/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:53:51,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:53:51,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:53:51,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:53:51,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:53:51,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:53:51,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:53:51,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:53:51,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:53:51,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:53:51,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:53:51,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:53:51,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:53:51,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:53:51,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:53:51,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:53:51,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:53:51,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:53:51,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:53:51,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:53:51,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:53:51,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:53:51,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:53:51,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:53:51,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:53:51,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:53:51,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:53:51,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:53:51,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:53:51,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:53:51,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:53:51,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:53:51,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:53:51,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:53:51,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:53:51,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:53:51,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:53:51,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:53:51,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:53:51,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:53:51,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:53:51,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:53:51,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:53:51,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:53:51,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:53:51,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:53:51,129 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:53:51,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:53:51,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:53:51,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:53:51,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:53:51,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:53:51,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:53:51,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:53:51,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:53:51,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:53:51,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:53:51,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:53:51,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:53:51,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:53:51,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:53:51,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:53:51,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:53:51,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:51,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:53:51,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:53:51,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:53:51,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:53:51,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:53:51,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:53:51,133 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-13 00:53:51,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:53:51,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:53:51,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:53:51,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:53:51,433 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:53:51,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:53:52,409 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:53:52,663 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:53:52,663 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:53:52,674 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1252a66/5577942f62144dc796f903445a7e7450/FLAG87e73133b [2022-12-13 00:53:52,685 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1252a66/5577942f62144dc796f903445a7e7450 [2022-12-13 00:53:52,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:53:52,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:53:52,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:52,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:53:52,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:53:52,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:52" (1/1) ... [2022-12-13 00:53:52,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@860d25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:52, skipping insertion in model container [2022-12-13 00:53:52,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:52" (1/1) ... [2022-12-13 00:53:52,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:53:52,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:53:52,854 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-13 00:53:52,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:52,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:52,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:53,033 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:53:53,043 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-13 00:53:53,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:53,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:53,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:53,130 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:53:53,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53 WrapperNode [2022-12-13 00:53:53,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:53,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:53,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:53:53,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:53:53,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,187 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-13 00:53:53,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:53,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:53:53,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:53:53,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:53:53,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:53:53,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:53:53,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:53:53,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:53:53,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (1/1) ... [2022-12-13 00:53:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:53:53,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:53:53,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:53:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:53:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:53:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:53:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:53:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:53:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:53:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:53:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:53:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:53:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:53:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:53:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:53:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:53:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:53:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:53:53,289 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:53:53,444 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:53:53,446 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:53:53,718 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:53:53,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:53:53,824 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:53:53,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:53 BoogieIcfgContainer [2022-12-13 00:53:53,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:53:53,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:53:53,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:53:53,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:53:53,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:53:52" (1/3) ... [2022-12-13 00:53:53,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ef479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:53, skipping insertion in model container [2022-12-13 00:53:53,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:53" (2/3) ... [2022-12-13 00:53:53,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ef479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:53, skipping insertion in model container [2022-12-13 00:53:53,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:53" (3/3) ... [2022-12-13 00:53:53,831 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:53:53,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:53:53,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:53:53,844 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:53:53,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:53:53,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 00:53:53,962 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 00:53:53,962 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:53,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:53:53,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 00:53:53,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-13 00:53:53,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:53,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 00:53:53,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-13 00:53:54,018 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 00:53:54,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:54,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:53:54,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 00:53:54,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 00:54:01,276 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 00:54:01,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:54:01,306 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;@48b8bd98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:54:01,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:54:01,308 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 00:54:01,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:01,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:01,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:54:01,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 493543, now seen corresponding path program 1 times [2022-12-13 00:54:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:01,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365718171] [2022-12-13 00:54:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:01,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365718171] [2022-12-13 00:54:01,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365718171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:01,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:01,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558148547] [2022-12-13 00:54:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:01,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:01,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:01,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:01,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2022-12-13 00:54:01,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:01,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:01,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2022-12-13 00:54:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:03,026 INFO L130 PetriNetUnfolder]: 7940/12809 cut-off events. [2022-12-13 00:54:03,027 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 00:54:03,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24247 conditions, 12809 events. 7940/12809 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 98035 event pairs, 1040 based on Foata normal form. 0/7897 useless extension candidates. Maximal degree in co-relation 24236. Up to 9645 conditions per place. [2022-12-13 00:54:03,058 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 34 selfloop transitions, 2 changer transitions 61/108 dead transitions. [2022-12-13 00:54:03,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 423 flow [2022-12-13 00:54:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-12-13 00:54:03,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 00:54:03,068 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 139 flow. Second operand 3 states and 135 transitions. [2022-12-13 00:54:03,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 423 flow [2022-12-13 00:54:03,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:54:03,072 INFO L231 Difference]: Finished difference. Result has 72 places, 32 transitions, 74 flow [2022-12-13 00:54:03,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=72, PETRI_TRANSITIONS=32} [2022-12-13 00:54:03,076 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-13 00:54:03,076 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:03,076 INFO L89 Accepts]: Start accepts. Operand has 72 places, 32 transitions, 74 flow [2022-12-13 00:54:03,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:03,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:03,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 32 transitions, 74 flow [2022-12-13 00:54:03,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 00:54:03,083 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:54:03,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:03,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 74 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:54:03,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 00:54:03,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 00:54:03,176 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:03,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 00:54:03,178 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 00:54:03,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:03,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:03,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:03,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:54:03,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:03,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1622328720, now seen corresponding path program 1 times [2022-12-13 00:54:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:03,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191051888] [2022-12-13 00:54:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:03,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191051888] [2022-12-13 00:54:03,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191051888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:03,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:03,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351177586] [2022-12-13 00:54:03,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:03,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:03,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:54:03,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:03,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:03,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:54:03,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:04,229 INFO L130 PetriNetUnfolder]: 2223/3473 cut-off events. [2022-12-13 00:54:04,229 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2022-12-13 00:54:04,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6961 conditions, 3473 events. 2223/3473 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17961 event pairs, 608 based on Foata normal form. 27/3042 useless extension candidates. Maximal degree in co-relation 6951. Up to 3026 conditions per place. [2022-12-13 00:54:04,247 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 41 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2022-12-13 00:54:04,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 242 flow [2022-12-13 00:54:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:54:04,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-13 00:54:04,249 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:54:04,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 242 flow [2022-12-13 00:54:04,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:04,251 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 140 flow [2022-12-13 00:54:04,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-13 00:54:04,252 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -31 predicate places. [2022-12-13 00:54:04,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:04,252 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 140 flow [2022-12-13 00:54:04,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:04,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:04,254 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 140 flow [2022-12-13 00:54:04,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 140 flow [2022-12-13 00:54:04,282 INFO L130 PetriNetUnfolder]: 126/367 cut-off events. [2022-12-13 00:54:04,283 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 00:54:04,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 367 events. 126/367 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2162 event pairs, 55 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 681. Up to 177 conditions per place. [2022-12-13 00:54:04,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 140 flow [2022-12-13 00:54:04,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 00:54:04,290 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:04,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 00:54:04,292 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 140 flow [2022-12-13 00:54:04,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:04,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:04,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:04,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:54:04,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1247407776, now seen corresponding path program 1 times [2022-12-13 00:54:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311490455] [2022-12-13 00:54:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311490455] [2022-12-13 00:54:04,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311490455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:04,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:04,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680961876] [2022-12-13 00:54:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:04,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:04,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:04,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:04,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:04,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:04,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:04,691 INFO L130 PetriNetUnfolder]: 1551/2523 cut-off events. [2022-12-13 00:54:04,691 INFO L131 PetriNetUnfolder]: For 981/981 co-relation queries the response was YES. [2022-12-13 00:54:04,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 2523 events. 1551/2523 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13281 event pairs, 430 based on Foata normal form. 8/2157 useless extension candidates. Maximal degree in co-relation 6389. Up to 2103 conditions per place. [2022-12-13 00:54:04,703 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2022-12-13 00:54:04,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 286 flow [2022-12-13 00:54:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 00:54:04,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:54:04,707 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 140 flow. Second operand 3 states and 64 transitions. [2022-12-13 00:54:04,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 286 flow [2022-12-13 00:54:04,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:04,711 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 171 flow [2022-12-13 00:54:04,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-13 00:54:04,712 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2022-12-13 00:54:04,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:04,713 INFO L89 Accepts]: Start accepts. Operand has 47 places, 44 transitions, 171 flow [2022-12-13 00:54:04,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:04,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:04,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 171 flow [2022-12-13 00:54:04,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 171 flow [2022-12-13 00:54:04,746 INFO L130 PetriNetUnfolder]: 185/484 cut-off events. [2022-12-13 00:54:04,747 INFO L131 PetriNetUnfolder]: For 134/137 co-relation queries the response was YES. [2022-12-13 00:54:04,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 484 events. 185/484 cut-off events. For 134/137 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2973 event pairs, 81 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 1009. Up to 238 conditions per place. [2022-12-13 00:54:04,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 171 flow [2022-12-13 00:54:04,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-13 00:54:04,753 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:04,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 00:54:04,754 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 171 flow [2022-12-13 00:54:04,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:04,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:04,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:04,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:54:04,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash -960943778, now seen corresponding path program 1 times [2022-12-13 00:54:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:04,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592782598] [2022-12-13 00:54:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:04,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592782598] [2022-12-13 00:54:04,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592782598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:04,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:04,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242385951] [2022-12-13 00:54:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:04,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:04,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:04,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:04,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:04,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:04,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:05,100 INFO L130 PetriNetUnfolder]: 1785/2898 cut-off events. [2022-12-13 00:54:05,100 INFO L131 PetriNetUnfolder]: For 1881/1893 co-relation queries the response was YES. [2022-12-13 00:54:05,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 2898 events. 1785/2898 cut-off events. For 1881/1893 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15551 event pairs, 739 based on Foata normal form. 9/2474 useless extension candidates. Maximal degree in co-relation 7787. Up to 2462 conditions per place. [2022-12-13 00:54:05,122 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 46 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2022-12-13 00:54:05,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 343 flow [2022-12-13 00:54:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 00:54:05,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 00:54:05,124 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 171 flow. Second operand 3 states and 66 transitions. [2022-12-13 00:54:05,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 343 flow [2022-12-13 00:54:05,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:05,127 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 198 flow [2022-12-13 00:54:05,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2022-12-13 00:54:05,129 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2022-12-13 00:54:05,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:05,129 INFO L89 Accepts]: Start accepts. Operand has 49 places, 47 transitions, 198 flow [2022-12-13 00:54:05,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:05,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:05,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 47 transitions, 198 flow [2022-12-13 00:54:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 198 flow [2022-12-13 00:54:05,173 INFO L130 PetriNetUnfolder]: 228/568 cut-off events. [2022-12-13 00:54:05,173 INFO L131 PetriNetUnfolder]: For 351/353 co-relation queries the response was YES. [2022-12-13 00:54:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 568 events. 228/568 cut-off events. For 351/353 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3537 event pairs, 85 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 1315. Up to 285 conditions per place. [2022-12-13 00:54:05,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 47 transitions, 198 flow [2022-12-13 00:54:05,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-13 00:54:05,179 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:05,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 00:54:05,183 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 198 flow [2022-12-13 00:54:05,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:05,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:05,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:05,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:54:05,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 275509956, now seen corresponding path program 1 times [2022-12-13 00:54:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:05,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622956673] [2022-12-13 00:54:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:05,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-13 00:54:05,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:05,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622956673] [2022-12-13 00:54:05,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622956673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:05,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:05,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976034704] [2022-12-13 00:54:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:05,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:05,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:05,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:05,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:05,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:05,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:05,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:05,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:05,735 INFO L130 PetriNetUnfolder]: 2510/4112 cut-off events. [2022-12-13 00:54:05,735 INFO L131 PetriNetUnfolder]: For 4395/4504 co-relation queries the response was YES. [2022-12-13 00:54:05,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11135 conditions, 4112 events. 2510/4112 cut-off events. For 4395/4504 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 24976 event pairs, 1078 based on Foata normal form. 134/3479 useless extension candidates. Maximal degree in co-relation 11118. Up to 2088 conditions per place. [2022-12-13 00:54:05,755 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 51 selfloop transitions, 4 changer transitions 2/69 dead transitions. [2022-12-13 00:54:05,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 395 flow [2022-12-13 00:54:05,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 00:54:05,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2022-12-13 00:54:05,757 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 198 flow. Second operand 3 states and 70 transitions. [2022-12-13 00:54:05,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 395 flow [2022-12-13 00:54:05,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:05,759 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 208 flow [2022-12-13 00:54:05,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-12-13 00:54:05,759 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -24 predicate places. [2022-12-13 00:54:05,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:05,760 INFO L89 Accepts]: Start accepts. Operand has 51 places, 47 transitions, 208 flow [2022-12-13 00:54:05,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:05,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:05,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 47 transitions, 208 flow [2022-12-13 00:54:05,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 208 flow [2022-12-13 00:54:05,800 INFO L130 PetriNetUnfolder]: 205/611 cut-off events. [2022-12-13 00:54:05,800 INFO L131 PetriNetUnfolder]: For 509/526 co-relation queries the response was YES. [2022-12-13 00:54:05,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 611 events. 205/611 cut-off events. For 509/526 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4300 event pairs, 83 based on Foata normal form. 4/468 useless extension candidates. Maximal degree in co-relation 1352. Up to 278 conditions per place. [2022-12-13 00:54:05,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 208 flow [2022-12-13 00:54:05,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 778 [2022-12-13 00:54:05,806 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:05,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 00:54:05,807 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 208 flow [2022-12-13 00:54:05,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:05,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:05,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:05,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:54:05,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash 275563028, now seen corresponding path program 1 times [2022-12-13 00:54:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:05,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793285520] [2022-12-13 00:54:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:05,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793285520] [2022-12-13 00:54:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793285520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:05,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:05,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:05,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341314294] [2022-12-13 00:54:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:05,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:05,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:05,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:05,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:05,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:05,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:05,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:05,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:05,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:06,321 INFO L130 PetriNetUnfolder]: 3489/5764 cut-off events. [2022-12-13 00:54:06,321 INFO L131 PetriNetUnfolder]: For 6421/6591 co-relation queries the response was YES. [2022-12-13 00:54:06,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15106 conditions, 5764 events. 3489/5764 cut-off events. For 6421/6591 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 38322 event pairs, 1097 based on Foata normal form. 136/4731 useless extension candidates. Maximal degree in co-relation 15088. Up to 2784 conditions per place. [2022-12-13 00:54:06,350 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 49 selfloop transitions, 4 changer transitions 2/67 dead transitions. [2022-12-13 00:54:06,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 389 flow [2022-12-13 00:54:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 00:54:06,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 00:54:06,352 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 208 flow. Second operand 3 states and 68 transitions. [2022-12-13 00:54:06,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 389 flow [2022-12-13 00:54:06,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 381 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:06,361 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 214 flow [2022-12-13 00:54:06,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-13 00:54:06,363 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -22 predicate places. [2022-12-13 00:54:06,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:06,363 INFO L89 Accepts]: Start accepts. Operand has 53 places, 47 transitions, 214 flow [2022-12-13 00:54:06,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:06,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:06,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 214 flow [2022-12-13 00:54:06,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 214 flow [2022-12-13 00:54:06,412 INFO L130 PetriNetUnfolder]: 201/728 cut-off events. [2022-12-13 00:54:06,412 INFO L131 PetriNetUnfolder]: For 651/670 co-relation queries the response was YES. [2022-12-13 00:54:06,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 728 events. 201/728 cut-off events. For 651/670 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5896 event pairs, 81 based on Foata normal form. 4/532 useless extension candidates. Maximal degree in co-relation 1546. Up to 287 conditions per place. [2022-12-13 00:54:06,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 214 flow [2022-12-13 00:54:06,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 00:54:06,419 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:06,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 00:54:06,420 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 214 flow [2022-12-13 00:54:06,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:06,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:06,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:06,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:54:06,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 275564547, now seen corresponding path program 1 times [2022-12-13 00:54:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:06,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803497223] [2022-12-13 00:54:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:06,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803497223] [2022-12-13 00:54:06,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803497223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:06,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:06,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232477358] [2022-12-13 00:54:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:06,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:06,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:06,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:06,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:06,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:06,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:07,368 INFO L130 PetriNetUnfolder]: 3589/5906 cut-off events. [2022-12-13 00:54:07,369 INFO L131 PetriNetUnfolder]: For 5619/5717 co-relation queries the response was YES. [2022-12-13 00:54:07,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15777 conditions, 5906 events. 3589/5906 cut-off events. For 5619/5717 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 38366 event pairs, 1959 based on Foata normal form. 39/4847 useless extension candidates. Maximal degree in co-relation 15758. Up to 5092 conditions per place. [2022-12-13 00:54:07,388 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 69 selfloop transitions, 19 changer transitions 0/100 dead transitions. [2022-12-13 00:54:07,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 646 flow [2022-12-13 00:54:07,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-13 00:54:07,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.68125 [2022-12-13 00:54:07,390 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 214 flow. Second operand 5 states and 109 transitions. [2022-12-13 00:54:07,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 646 flow [2022-12-13 00:54:07,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 100 transitions, 626 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:07,394 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 366 flow [2022-12-13 00:54:07,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-13 00:54:07,394 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2022-12-13 00:54:07,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:07,395 INFO L89 Accepts]: Start accepts. Operand has 59 places, 63 transitions, 366 flow [2022-12-13 00:54:07,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:07,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:07,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 366 flow [2022-12-13 00:54:07,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 366 flow [2022-12-13 00:54:07,458 INFO L130 PetriNetUnfolder]: 302/881 cut-off events. [2022-12-13 00:54:07,458 INFO L131 PetriNetUnfolder]: For 1558/1631 co-relation queries the response was YES. [2022-12-13 00:54:07,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 881 events. 302/881 cut-off events. For 1558/1631 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6749 event pairs, 83 based on Foata normal form. 21/696 useless extension candidates. Maximal degree in co-relation 2495. Up to 392 conditions per place. [2022-12-13 00:54:07,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 366 flow [2022-12-13 00:54:07,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 960 [2022-12-13 00:54:07,467 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:07,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 00:54:07,468 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 366 flow [2022-12-13 00:54:07,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:07,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:07,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:07,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:54:07,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1915987607, now seen corresponding path program 2 times [2022-12-13 00:54:07,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:07,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873103035] [2022-12-13 00:54:07,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:07,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:07,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:07,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873103035] [2022-12-13 00:54:07,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873103035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:07,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:07,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441713398] [2022-12-13 00:54:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:07,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:07,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:07,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:07,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:07,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:07,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:08,230 INFO L130 PetriNetUnfolder]: 3610/5938 cut-off events. [2022-12-13 00:54:08,230 INFO L131 PetriNetUnfolder]: For 10072/10190 co-relation queries the response was YES. [2022-12-13 00:54:08,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18398 conditions, 5938 events. 3610/5938 cut-off events. For 10072/10190 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 38493 event pairs, 1963 based on Foata normal form. 50/4890 useless extension candidates. Maximal degree in co-relation 18375. Up to 5101 conditions per place. [2022-12-13 00:54:08,264 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 67 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2022-12-13 00:54:08,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 696 flow [2022-12-13 00:54:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 00:54:08,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.703125 [2022-12-13 00:54:08,266 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 366 flow. Second operand 4 states and 90 transitions. [2022-12-13 00:54:08,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 696 flow [2022-12-13 00:54:08,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 97 transitions, 694 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:08,276 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 491 flow [2022-12-13 00:54:08,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2022-12-13 00:54:08,277 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2022-12-13 00:54:08,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:08,277 INFO L89 Accepts]: Start accepts. Operand has 64 places, 71 transitions, 491 flow [2022-12-13 00:54:08,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:08,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:08,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 71 transitions, 491 flow [2022-12-13 00:54:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 71 transitions, 491 flow [2022-12-13 00:54:08,348 INFO L130 PetriNetUnfolder]: 329/931 cut-off events. [2022-12-13 00:54:08,348 INFO L131 PetriNetUnfolder]: For 2789/2886 co-relation queries the response was YES. [2022-12-13 00:54:08,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3069 conditions, 931 events. 329/931 cut-off events. For 2789/2886 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7097 event pairs, 76 based on Foata normal form. 33/745 useless extension candidates. Maximal degree in co-relation 3045. Up to 406 conditions per place. [2022-12-13 00:54:08,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 71 transitions, 491 flow [2022-12-13 00:54:08,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 1038 [2022-12-13 00:54:08,359 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:08,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 00:54:08,360 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 491 flow [2022-12-13 00:54:08,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:08,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:08,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:54:08,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -739868840, now seen corresponding path program 1 times [2022-12-13 00:54:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:08,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73736327] [2022-12-13 00:54:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:08,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73736327] [2022-12-13 00:54:08,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73736327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:08,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:08,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002307811] [2022-12-13 00:54:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:08,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:08,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:08,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:08,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:08,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:08,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:08,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:08,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:09,245 INFO L130 PetriNetUnfolder]: 3575/5897 cut-off events. [2022-12-13 00:54:09,245 INFO L131 PetriNetUnfolder]: For 16200/16312 co-relation queries the response was YES. [2022-12-13 00:54:09,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19987 conditions, 5897 events. 3575/5897 cut-off events. For 16200/16312 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 38123 event pairs, 2081 based on Foata normal form. 52/4862 useless extension candidates. Maximal degree in co-relation 19960. Up to 4910 conditions per place. [2022-12-13 00:54:09,279 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 70 selfloop transitions, 18 changer transitions 1/101 dead transitions. [2022-12-13 00:54:09,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 820 flow [2022-12-13 00:54:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 00:54:09,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 00:54:09,280 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 491 flow. Second operand 4 states and 87 transitions. [2022-12-13 00:54:09,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 820 flow [2022-12-13 00:54:09,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 816 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:09,288 INFO L231 Difference]: Finished difference. Result has 69 places, 79 transitions, 625 flow [2022-12-13 00:54:09,288 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=69, PETRI_TRANSITIONS=79} [2022-12-13 00:54:09,289 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2022-12-13 00:54:09,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:09,289 INFO L89 Accepts]: Start accepts. Operand has 69 places, 79 transitions, 625 flow [2022-12-13 00:54:09,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:09,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:09,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 79 transitions, 625 flow [2022-12-13 00:54:09,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 79 transitions, 625 flow [2022-12-13 00:54:09,376 INFO L130 PetriNetUnfolder]: 331/939 cut-off events. [2022-12-13 00:54:09,376 INFO L131 PetriNetUnfolder]: For 2968/3042 co-relation queries the response was YES. [2022-12-13 00:54:09,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 939 events. 331/939 cut-off events. For 2968/3042 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7198 event pairs, 74 based on Foata normal form. 29/745 useless extension candidates. Maximal degree in co-relation 3373. Up to 407 conditions per place. [2022-12-13 00:54:09,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 79 transitions, 625 flow [2022-12-13 00:54:09,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 1092 [2022-12-13 00:54:09,386 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:09,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 00:54:09,387 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 79 transitions, 625 flow [2022-12-13 00:54:09,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:09,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:09,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:09,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:54:09,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:09,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash -741239691, now seen corresponding path program 1 times [2022-12-13 00:54:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123722357] [2022-12-13 00:54:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:09,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123722357] [2022-12-13 00:54:09,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123722357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:09,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:09,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51814276] [2022-12-13 00:54:09,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:09,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:09,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:09,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:09,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:54:09,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 79 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:09,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:09,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:54:09,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:10,259 INFO L130 PetriNetUnfolder]: 3833/6342 cut-off events. [2022-12-13 00:54:10,259 INFO L131 PetriNetUnfolder]: For 21283/21425 co-relation queries the response was YES. [2022-12-13 00:54:10,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23134 conditions, 6342 events. 3833/6342 cut-off events. For 21283/21425 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 41825 event pairs, 2016 based on Foata normal form. 77/5282 useless extension candidates. Maximal degree in co-relation 23103. Up to 4616 conditions per place. [2022-12-13 00:54:10,283 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 70 selfloop transitions, 46 changer transitions 4/132 dead transitions. [2022-12-13 00:54:10,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 1134 flow [2022-12-13 00:54:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:54:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:54:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-12-13 00:54:10,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2022-12-13 00:54:10,285 INFO L175 Difference]: Start difference. First operand has 69 places, 79 transitions, 625 flow. Second operand 6 states and 131 transitions. [2022-12-13 00:54:10,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 1134 flow [2022-12-13 00:54:10,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 132 transitions, 1115 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:10,295 INFO L231 Difference]: Finished difference. Result has 75 places, 90 transitions, 843 flow [2022-12-13 00:54:10,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=843, PETRI_PLACES=75, PETRI_TRANSITIONS=90} [2022-12-13 00:54:10,296 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2022-12-13 00:54:10,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:10,296 INFO L89 Accepts]: Start accepts. Operand has 75 places, 90 transitions, 843 flow [2022-12-13 00:54:10,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:10,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:10,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 90 transitions, 843 flow [2022-12-13 00:54:10,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 90 transitions, 843 flow [2022-12-13 00:54:10,371 INFO L130 PetriNetUnfolder]: 362/977 cut-off events. [2022-12-13 00:54:10,371 INFO L131 PetriNetUnfolder]: For 4231/4312 co-relation queries the response was YES. [2022-12-13 00:54:10,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 977 events. 362/977 cut-off events. For 4231/4312 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7437 event pairs, 71 based on Foata normal form. 34/794 useless extension candidates. Maximal degree in co-relation 4202. Up to 446 conditions per place. [2022-12-13 00:54:10,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 90 transitions, 843 flow [2022-12-13 00:54:10,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 1184 [2022-12-13 00:54:10,383 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:10,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 00:54:10,384 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 90 transitions, 843 flow [2022-12-13 00:54:10,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:10,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:10,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:10,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:54:10,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1133214894, now seen corresponding path program 1 times [2022-12-13 00:54:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:10,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623899670] [2022-12-13 00:54:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:10,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:10,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623899670] [2022-12-13 00:54:10,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623899670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:10,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:10,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959033773] [2022-12-13 00:54:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:10,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:10,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:10,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:10,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:10,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:54:10,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 90 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:10,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:10,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:54:10,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:11,156 INFO L130 PetriNetUnfolder]: 4694/7484 cut-off events. [2022-12-13 00:54:11,156 INFO L131 PetriNetUnfolder]: For 38807/38991 co-relation queries the response was YES. [2022-12-13 00:54:11,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28997 conditions, 7484 events. 4694/7484 cut-off events. For 38807/38991 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 49444 event pairs, 1431 based on Foata normal form. 117/5122 useless extension candidates. Maximal degree in co-relation 28963. Up to 7018 conditions per place. [2022-12-13 00:54:11,189 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 74 selfloop transitions, 10 changer transitions 5/103 dead transitions. [2022-12-13 00:54:11,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 1022 flow [2022-12-13 00:54:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 00:54:11,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 00:54:11,191 INFO L175 Difference]: Start difference. First operand has 75 places, 90 transitions, 843 flow. Second operand 3 states and 68 transitions. [2022-12-13 00:54:11,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 1022 flow [2022-12-13 00:54:11,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 103 transitions, 949 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-13 00:54:11,222 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 632 flow [2022-12-13 00:54:11,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2022-12-13 00:54:11,222 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2022-12-13 00:54:11,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:11,222 INFO L89 Accepts]: Start accepts. Operand has 74 places, 80 transitions, 632 flow [2022-12-13 00:54:11,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:11,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:11,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 80 transitions, 632 flow [2022-12-13 00:54:11,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 80 transitions, 632 flow [2022-12-13 00:54:11,548 INFO L130 PetriNetUnfolder]: 2334/4407 cut-off events. [2022-12-13 00:54:11,549 INFO L131 PetriNetUnfolder]: For 9860/9980 co-relation queries the response was YES. [2022-12-13 00:54:11,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 4407 events. 2334/4407 cut-off events. For 9860/9980 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 37408 event pairs, 1203 based on Foata normal form. 32/2468 useless extension candidates. Maximal degree in co-relation 13296. Up to 2986 conditions per place. [2022-12-13 00:54:11,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 80 transitions, 632 flow [2022-12-13 00:54:11,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 1030 [2022-12-13 00:54:11,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:11,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 674 [2022-12-13 00:54:11,896 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 636 flow [2022-12-13 00:54:11,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:11,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:11,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:11,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:54:11,897 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 542530270, now seen corresponding path program 1 times [2022-12-13 00:54:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:11,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175493787] [2022-12-13 00:54:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:11,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175493787] [2022-12-13 00:54:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175493787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:11,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864618271] [2022-12-13 00:54:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:11,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:11,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:54:11,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:12,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:12,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:54:12,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:12,480 INFO L130 PetriNetUnfolder]: 2395/4311 cut-off events. [2022-12-13 00:54:12,480 INFO L131 PetriNetUnfolder]: For 14456/14565 co-relation queries the response was YES. [2022-12-13 00:54:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18043 conditions, 4311 events. 2395/4311 cut-off events. For 14456/14565 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 30203 event pairs, 306 based on Foata normal form. 276/3164 useless extension candidates. Maximal degree in co-relation 18009. Up to 3151 conditions per place. [2022-12-13 00:54:12,504 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 77 selfloop transitions, 19 changer transitions 2/112 dead transitions. [2022-12-13 00:54:12,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 1022 flow [2022-12-13 00:54:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 00:54:12,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2022-12-13 00:54:12,505 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 636 flow. Second operand 4 states and 94 transitions. [2022-12-13 00:54:12,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 1022 flow [2022-12-13 00:54:12,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 956 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 00:54:12,543 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 661 flow [2022-12-13 00:54:12,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=661, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2022-12-13 00:54:12,543 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2022-12-13 00:54:12,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:12,543 INFO L89 Accepts]: Start accepts. Operand has 74 places, 86 transitions, 661 flow [2022-12-13 00:54:12,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:12,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:12,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 86 transitions, 661 flow [2022-12-13 00:54:12,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 86 transitions, 661 flow [2022-12-13 00:54:12,761 INFO L130 PetriNetUnfolder]: 1086/2589 cut-off events. [2022-12-13 00:54:12,761 INFO L131 PetriNetUnfolder]: For 4999/6022 co-relation queries the response was YES. [2022-12-13 00:54:12,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 2589 events. 1086/2589 cut-off events. For 4999/6022 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 23281 event pairs, 213 based on Foata normal form. 26/1616 useless extension candidates. Maximal degree in co-relation 9638. Up to 1669 conditions per place. [2022-12-13 00:54:12,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 86 transitions, 661 flow [2022-12-13 00:54:12,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-13 00:54:12,791 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:12,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-13 00:54:12,791 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 661 flow [2022-12-13 00:54:12,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:12,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:12,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:12,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:54:12,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1627138692, now seen corresponding path program 1 times [2022-12-13 00:54:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:12,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383837859] [2022-12-13 00:54:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:12,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:12,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383837859] [2022-12-13 00:54:12,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383837859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:12,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:12,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929125934] [2022-12-13 00:54:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:12,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:12,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:12,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:54:12,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 661 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:12,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:12,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:54:12,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:13,143 INFO L130 PetriNetUnfolder]: 1306/2511 cut-off events. [2022-12-13 00:54:13,143 INFO L131 PetriNetUnfolder]: For 5980/6016 co-relation queries the response was YES. [2022-12-13 00:54:13,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11643 conditions, 2511 events. 1306/2511 cut-off events. For 5980/6016 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16871 event pairs, 54 based on Foata normal form. 271/1888 useless extension candidates. Maximal degree in co-relation 11610. Up to 1372 conditions per place. [2022-12-13 00:54:13,154 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 36 selfloop transitions, 28 changer transitions 40/112 dead transitions. [2022-12-13 00:54:13,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 1032 flow [2022-12-13 00:54:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 00:54:13,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 00:54:13,155 INFO L175 Difference]: Start difference. First operand has 74 places, 86 transitions, 661 flow. Second operand 5 states and 100 transitions. [2022-12-13 00:54:13,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 1032 flow [2022-12-13 00:54:13,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 974 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:13,167 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 427 flow [2022-12-13 00:54:13,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2022-12-13 00:54:13,168 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2022-12-13 00:54:13,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:13,168 INFO L89 Accepts]: Start accepts. Operand has 77 places, 57 transitions, 427 flow [2022-12-13 00:54:13,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:13,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:13,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 57 transitions, 427 flow [2022-12-13 00:54:13,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 57 transitions, 427 flow [2022-12-13 00:54:13,189 INFO L130 PetriNetUnfolder]: 118/333 cut-off events. [2022-12-13 00:54:13,189 INFO L131 PetriNetUnfolder]: For 271/307 co-relation queries the response was YES. [2022-12-13 00:54:13,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 333 events. 118/333 cut-off events. For 271/307 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1930 event pairs, 1 based on Foata normal form. 2/180 useless extension candidates. Maximal degree in co-relation 1185. Up to 217 conditions per place. [2022-12-13 00:54:13,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 57 transitions, 427 flow [2022-12-13 00:54:13,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 00:54:13,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] L789-->L792: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0] and [330] L772-->L779: Formula: (let ((.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_101 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_55 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_36 v_~z~0_56))) (= v_~z$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_97)) (= v_~z$w_buff0_used~0_101 (ite .cse0 0 v_~z$w_buff0_used~0_102)) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_20))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_102, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 00:54:13,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] L789-->L792: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0] and [323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-13 00:54:14,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] $Ultimate##0-->L752: Formula: (and (= v_~z$r_buff0_thd0~0_367 v_~z$r_buff1_thd0~0_353) (= v_~z$r_buff0_thd1~0_152 1) (= v_~z$r_buff0_thd3~0_94 v_~z$r_buff1_thd3~0_101) (= v_~z$w_buff0~0_416 v_~z$w_buff1~0_378) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_42| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_40| |v_P0Thread1of1ForFork2_~arg#1.offset_40|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_42| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_590 256) 0)) (not (= (mod v_~z$w_buff1_used~0_546 256) 0)))) 1 0)) (= v_~x~0_150 1) (= v_~z$r_buff0_thd1~0_153 v_~z$r_buff1_thd1~0_108) (= v_~z$r_buff0_thd2~0_170 v_~z$r_buff1_thd2~0_171) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_42| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_42|) (= v_~z$w_buff0_used~0_590 1) (= v_~z$w_buff0_used~0_591 v_~z$w_buff1_used~0_546) (= v_~z$w_buff0~0_415 2) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_40| |v_P0Thread1of1ForFork2_~arg#1.base_40|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_367, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_591, ~z$w_buff0~0=v_~z$w_buff0~0_416, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_40|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_40|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_153, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_590, ~z$w_buff0~0=v_~z$w_buff0~0_415, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_40|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_101, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_171, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_42|, ~z$w_buff1~0=v_~z$w_buff1~0_378, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_40|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_40|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_367, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_353, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_152, ~x~0=v_~x~0_150, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] and [433] $Ultimate##0-->L769: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_56 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 00:54:14,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] $Ultimate##0-->L779: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_176 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_175 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_604 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= 0 (mod v_~z$w_buff0_used~0_605 256))))) (.cse0 (and (not (= (mod v_~z$w_buff1_used~0_557 256) 0)) .cse3))) (and (= v_~y~0_153 2) (= v_~z$w_buff1_used~0_556 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_557)) (= v_P2Thread1of1ForFork1_~arg.offset_13 |v_P2Thread1of1ForFork1_#in~arg.offset_13|) (= v_~z$w_buff0_used~0_604 (ite .cse2 0 v_~z$w_buff0_used~0_605)) (= v_P2Thread1of1ForFork1_~arg.base_13 |v_P2Thread1of1ForFork1_#in~arg.base_13|) (= v_~z$r_buff0_thd2~0_174 (ite .cse1 0 v_~z$r_buff0_thd2~0_175)) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_556 256) 0))) (and (not (= (mod v_~z$r_buff0_thd2~0_174 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_176) v_~z$r_buff1_thd2~0_175) (= v_~z~0_505 (ite .cse2 v_~z$w_buff0~0_425 (ite .cse0 v_~z$w_buff1~0_384 1)))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_605, ~z$w_buff0~0=v_~z$w_buff0~0_425, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_176, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$w_buff1~0=v_~z$w_buff1~0_384, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_175} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_425, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_175, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_556, ~z$w_buff1~0=v_~z$w_buff1~0_384, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~z~0=v_~z~0_505, ~y~0=v_~y~0_153, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_174} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~y~0, ~z$r_buff0_thd2~0] and [337] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-13 00:54:14,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [496] $Ultimate##0-->L759: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_115 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_608 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_163 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_609 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_561 256) 0))))) (and (= v_~z$w_buff0_used~0_608 (ite .cse0 0 v_~z$w_buff0_used~0_609)) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_561) v_~z$w_buff1_used~0_560) (= v_~z$r_buff0_thd1~0_162 (ite .cse2 0 v_~z$r_buff0_thd1~0_163)) (= v_~z~0_507 (ite .cse0 v_~z$w_buff0~0_427 (ite .cse1 v_~z$w_buff1~0_386 1))) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_~z$r_buff1_thd1~0_114 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_560 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_162 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_115)) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|) (= v_~y~0_155 2)))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_609, ~z$w_buff0~0=v_~z$w_buff0~0_427, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_115, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_561, ~z$w_buff1~0=v_~z$w_buff1~0_386, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_608, ~z$w_buff0~0=v_~z$w_buff0~0_427, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_560, ~z$w_buff1~0=v_~z$w_buff1~0_386, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~z~0=v_~z~0_507, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_162, ~y~0=v_~y~0_155} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0, ~y~0] and [337] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-13 00:54:15,134 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 00:54:15,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1966 [2022-12-13 00:54:15,135 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 449 flow [2022-12-13 00:54:15,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:15,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:15,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:15,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:54:15,135 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash 251707218, now seen corresponding path program 1 times [2022-12-13 00:54:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:15,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440433297] [2022-12-13 00:54:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:34,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:34,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440433297] [2022-12-13 00:54:34,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440433297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:34,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:34,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:54:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513502262] [2022-12-13 00:54:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:34,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:54:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:54:34,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:54:34,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:54:34,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 449 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:34,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:34,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:54:34,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:34,513 INFO L130 PetriNetUnfolder]: 530/972 cut-off events. [2022-12-13 00:54:34,514 INFO L131 PetriNetUnfolder]: For 2687/2805 co-relation queries the response was YES. [2022-12-13 00:54:34,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4505 conditions, 972 events. 530/972 cut-off events. For 2687/2805 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5216 event pairs, 64 based on Foata normal form. 83/824 useless extension candidates. Maximal degree in co-relation 4471. Up to 510 conditions per place. [2022-12-13 00:54:34,518 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 37 selfloop transitions, 8 changer transitions 47/104 dead transitions. [2022-12-13 00:54:34,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 104 transitions, 997 flow [2022-12-13 00:54:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:54:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:54:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-13 00:54:34,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4453125 [2022-12-13 00:54:34,520 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 449 flow. Second operand 8 states and 114 transitions. [2022-12-13 00:54:34,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 104 transitions, 997 flow [2022-12-13 00:54:34,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 724 flow, removed 57 selfloop flow, removed 20 redundant places. [2022-12-13 00:54:34,529 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 315 flow [2022-12-13 00:54:34,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=315, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2022-12-13 00:54:34,529 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -15 predicate places. [2022-12-13 00:54:34,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:34,529 INFO L89 Accepts]: Start accepts. Operand has 60 places, 52 transitions, 315 flow [2022-12-13 00:54:34,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:34,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:34,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 52 transitions, 315 flow [2022-12-13 00:54:34,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 315 flow [2022-12-13 00:54:34,547 INFO L130 PetriNetUnfolder]: 118/280 cut-off events. [2022-12-13 00:54:34,547 INFO L131 PetriNetUnfolder]: For 538/558 co-relation queries the response was YES. [2022-12-13 00:54:34,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 280 events. 118/280 cut-off events. For 538/558 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 1596 event pairs, 0 based on Foata normal form. 2/127 useless extension candidates. Maximal degree in co-relation 876. Up to 136 conditions per place. [2022-12-13 00:54:34,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 315 flow [2022-12-13 00:54:34,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 00:54:34,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L772: Formula: (and (= v_~z$w_buff0_used~0_642 1) (= v_~z$w_buff0_used~0_643 v_~z$w_buff1_used~0_592) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_642 256) 0)) (not (= (mod v_~z$w_buff1_used~0_592 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_165 1) (= v_~z$r_buff0_thd3~0_112 v_~z$r_buff1_thd3~0_119) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~z$r_buff0_thd1~0_174 1) (= v_~z$r_buff0_thd1~0_175 v_~z$r_buff1_thd1~0_124) (= v_~z$w_buff0~0_445 2) (= v_~z$r_buff0_thd0~0_383 v_~z$r_buff1_thd0~0_369) (= v_~z$r_buff0_thd2~0_188 v_~z$r_buff1_thd2~0_189) (= v_~z$w_buff0~0_446 v_~z$w_buff1~0_402) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48| 0)) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|) (= 2 v_~x~0_160) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_643, ~z$w_buff0~0=v_~z$w_buff0~0_446, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_175, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_642, ~z$w_buff0~0=v_~z$w_buff0~0_445, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_189, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_592, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48|, ~z$w_buff1~0=v_~z$w_buff1~0_402, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_369, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_124, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, ~y~0=v_~y~0_165, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_160, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P1Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~y~0, ~z$r_buff0_thd1~0, ~x~0] and [500] $Ultimate##0-->L799: Formula: (let ((.cse14 (not (= (mod v_~z$r_buff0_thd2~0_185 256) 0)))) (let ((.cse2 (and .cse14 (not (= (mod v_~z$w_buff0_used~0_632 256) 0))))) (let ((.cse7 (ite .cse2 0 v_~z$w_buff0_used~0_632))) (let ((.cse12 (not (= (mod .cse7 256) 0))) (.cse11 (not (= (mod v_~z$r_buff1_thd2~0_186 256) 0)))) (let ((.cse3 (and .cse11 (not (= (mod v_~z$w_buff1_used~0_582 256) 0)))) (.cse6 (and .cse14 .cse12))) (let ((.cse5 (ite (or .cse3 .cse6) 0 v_~z$w_buff1_used~0_582))) (let ((.cse8 (not (= (mod v_~z$w_buff0_used~0_630 256) 0))) (.cse13 (not (= (mod v_~z$r_buff0_thd3~0_105 256) 0))) (.cse10 (not (= (mod .cse5 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_112 256) 0)))) (let ((.cse1 (and .cse10 .cse9)) (.cse0 (and .cse12 .cse13)) (.cse4 (and .cse13 .cse8))) (and (= v_P2Thread1of1ForFork1_~arg.base_19 |v_P2Thread1of1ForFork1_#in~arg.base_19|) (= v_~z~0_522 (ite .cse0 v_~z$w_buff0~0_441 (ite .cse1 v_~z$w_buff1~0_398 (ite .cse2 v_~z$w_buff0~0_441 (ite .cse3 v_~z$w_buff1~0_398 1))))) (= v_~z$w_buff1_used~0_580 (ite (or .cse4 .cse1) 0 .cse5)) (= v_~z$r_buff0_thd2~0_184 (ite .cse6 0 v_~z$r_buff0_thd2~0_185)) (= (ite .cse0 0 .cse7) v_~z$w_buff0_used~0_630) (= v_P2Thread1of1ForFork1_~arg.offset_19 |v_P2Thread1of1ForFork1_#in~arg.offset_19|) (= v_~z$r_buff1_thd3~0_111 (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_104 256) 0)) .cse8) (and (not (= (mod v_~z$w_buff1_used~0_580 256) 0)) .cse9)) 0 v_~z$r_buff1_thd3~0_112)) (= (ite (or (and .cse10 .cse11) (and .cse12 (not (= (mod v_~z$r_buff0_thd2~0_184 256) 0)))) 0 v_~z$r_buff1_thd2~0_186) v_~z$r_buff1_thd2~0_185) (= v_~z$r_buff0_thd3~0_104 (ite .cse4 0 v_~z$r_buff0_thd3~0_105)) (= v_~y~0_161 2)))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_632, ~z$w_buff0~0=v_~z$w_buff0~0_441, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_112, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_582, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_105, ~z$w_buff1~0=v_~z$w_buff1~0_398, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_441, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_111, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_580, ~z$w_buff1~0=v_~z$w_buff1~0_398, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_104, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~z~0=v_~z~0_522, ~y~0=v_~y~0_161, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0, ~y~0, ~z$r_buff0_thd2~0] [2022-12-13 00:54:35,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L772: Formula: (and (= v_~z$w_buff0_used~0_642 1) (= v_~z$w_buff0_used~0_643 v_~z$w_buff1_used~0_592) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_642 256) 0)) (not (= (mod v_~z$w_buff1_used~0_592 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_165 1) (= v_~z$r_buff0_thd3~0_112 v_~z$r_buff1_thd3~0_119) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~z$r_buff0_thd1~0_174 1) (= v_~z$r_buff0_thd1~0_175 v_~z$r_buff1_thd1~0_124) (= v_~z$w_buff0~0_445 2) (= v_~z$r_buff0_thd0~0_383 v_~z$r_buff1_thd0~0_369) (= v_~z$r_buff0_thd2~0_188 v_~z$r_buff1_thd2~0_189) (= v_~z$w_buff0~0_446 v_~z$w_buff1~0_402) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48| 0)) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|) (= 2 v_~x~0_160) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_643, ~z$w_buff0~0=v_~z$w_buff0~0_446, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_175, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_642, ~z$w_buff0~0=v_~z$w_buff0~0_445, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_189, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_592, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48|, ~z$w_buff1~0=v_~z$w_buff1~0_402, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_369, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_124, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, ~y~0=v_~y~0_165, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_160, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P1Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~y~0, ~z$r_buff0_thd1~0, ~x~0] and [497] $Ultimate##0-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_106 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_99 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_612 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_565 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_613 256) 0))))) (and (= (ite .cse0 0 v_~z$r_buff0_thd3~0_99) v_~z$r_buff0_thd3~0_98) (= v_~z$w_buff1_used~0_564 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_565)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_98 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_564 256) 0)))) 0 v_~z$r_buff1_thd3~0_106) v_~z$r_buff1_thd3~0_105) (= v_~y~0_157 2) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= (ite .cse4 v_~z$w_buff0~0_429 (ite .cse1 v_~z$w_buff1~0_388 1)) v_~z~0_509) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|) (= (ite .cse4 0 v_~z$w_buff0_used~0_613) v_~z$w_buff0_used~0_612)))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_613, ~z$w_buff0~0=v_~z$w_buff0~0_429, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_106, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_565, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$w_buff1~0=v_~z$w_buff1~0_388, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_612, ~z$w_buff0~0=v_~z$w_buff0~0_429, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_105, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_564, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_98, ~z$w_buff1~0=v_~z$w_buff1~0_388, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~z~0=v_~z~0_509, ~y~0=v_~y~0_157} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0, ~y~0] [2022-12-13 00:54:35,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L772: Formula: (and (= v_~z$w_buff0_used~0_642 1) (= v_~z$w_buff0_used~0_643 v_~z$w_buff1_used~0_592) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_642 256) 0)) (not (= (mod v_~z$w_buff1_used~0_592 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_165 1) (= v_~z$r_buff0_thd3~0_112 v_~z$r_buff1_thd3~0_119) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~z$r_buff0_thd1~0_174 1) (= v_~z$r_buff0_thd1~0_175 v_~z$r_buff1_thd1~0_124) (= v_~z$w_buff0~0_445 2) (= v_~z$r_buff0_thd0~0_383 v_~z$r_buff1_thd0~0_369) (= v_~z$r_buff0_thd2~0_188 v_~z$r_buff1_thd2~0_189) (= v_~z$w_buff0~0_446 v_~z$w_buff1~0_402) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48| 0)) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|) (= 2 v_~x~0_160) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_643, ~z$w_buff0~0=v_~z$w_buff0~0_446, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_175, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_642, ~z$w_buff0~0=v_~z$w_buff0~0_445, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_189, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_592, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48|, ~z$w_buff1~0=v_~z$w_buff1~0_402, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_369, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_124, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, ~y~0=v_~y~0_165, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_160, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P1Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~y~0, ~z$r_buff0_thd1~0, ~x~0] and [323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-13 00:54:35,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L772: Formula: (and (= v_~z$w_buff0_used~0_642 1) (= v_~z$w_buff0_used~0_643 v_~z$w_buff1_used~0_592) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_642 256) 0)) (not (= (mod v_~z$w_buff1_used~0_592 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_165 1) (= v_~z$r_buff0_thd3~0_112 v_~z$r_buff1_thd3~0_119) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~z$r_buff0_thd1~0_174 1) (= v_~z$r_buff0_thd1~0_175 v_~z$r_buff1_thd1~0_124) (= v_~z$w_buff0~0_445 2) (= v_~z$r_buff0_thd0~0_383 v_~z$r_buff1_thd0~0_369) (= v_~z$r_buff0_thd2~0_188 v_~z$r_buff1_thd2~0_189) (= v_~z$w_buff0~0_446 v_~z$w_buff1~0_402) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48| 0)) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|) (= 2 v_~x~0_160) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_643, ~z$w_buff0~0=v_~z$w_buff0~0_446, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_175, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_642, ~z$w_buff0~0=v_~z$w_buff0~0_445, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_189, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_592, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48|, ~z$w_buff1~0=v_~z$w_buff1~0_402, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_369, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_124, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, ~y~0=v_~y~0_165, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_160, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P1Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~y~0, ~z$r_buff0_thd1~0, ~x~0] and [501] $Ultimate##0-->L799: Formula: (let ((.cse14 (not (= (mod v_~z$r_buff0_thd1~0_171 256) 0)))) (let ((.cse4 (and .cse14 (not (= (mod v_~z$w_buff0_used~0_638 256) 0))))) (let ((.cse12 (ite .cse4 0 v_~z$w_buff0_used~0_638))) (let ((.cse11 (not (= (mod v_~z$r_buff1_thd1~0_121 256) 0))) (.cse9 (not (= (mod .cse12 256) 0)))) (let ((.cse6 (and .cse14 .cse9)) (.cse5 (and (not (= (mod v_~z$w_buff1_used~0_588 256) 0)) .cse11))) (let ((.cse8 (ite (or .cse6 .cse5) 0 v_~z$w_buff1_used~0_588))) (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_636 256) 0))) (.cse13 (not (= (mod v_~z$r_buff0_thd3~0_109 256) 0))) (.cse10 (not (= (mod .cse8 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd3~0_116 256) 0)))) (let ((.cse3 (and .cse10 .cse1)) (.cse7 (and .cse0 .cse13)) (.cse2 (and .cse9 .cse13))) (and (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z$r_buff1_thd3~0_115 (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd3~0_108 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_586 256) 0)) .cse1)) 0 v_~z$r_buff1_thd3~0_116)) (= v_~z~0_526 (ite .cse2 v_~z$w_buff0~0_443 (ite .cse3 v_~z$w_buff1~0_400 (ite .cse4 v_~z$w_buff0~0_443 (ite .cse5 v_~z$w_buff1~0_400 1))))) (= v_~z$r_buff0_thd1~0_170 (ite .cse6 0 v_~z$r_buff0_thd1~0_171)) (= (ite (or .cse7 .cse3) 0 .cse8) v_~z$w_buff1_used~0_586) (= (ite .cse7 0 v_~z$r_buff0_thd3~0_109) v_~z$r_buff0_thd3~0_108) (= v_~z$r_buff1_thd1~0_120 (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_170 256) 0)) .cse9) (and .cse10 .cse11)) 0 v_~z$r_buff1_thd1~0_121)) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~y~0_163 2) (= v_~z$w_buff0_used~0_636 (ite .cse2 0 .cse12))))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_638, ~z$w_buff0~0=v_~z$w_buff0~0_443, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_116, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_121, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_588, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_400, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_171} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_636, ~z$w_buff0~0=v_~z$w_buff0~0_443, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_115, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_586, ~z$w_buff1~0=v_~z$w_buff1~0_400, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_120, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_108, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_526, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170, ~y~0=v_~y~0_163} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd3~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0, ~z$r_buff0_thd1~0, ~y~0] [2022-12-13 00:54:35,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L772: Formula: (and (= v_~z$w_buff0_used~0_642 1) (= v_~z$w_buff0_used~0_643 v_~z$w_buff1_used~0_592) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_642 256) 0)) (not (= (mod v_~z$w_buff1_used~0_592 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_165 1) (= v_~z$r_buff0_thd3~0_112 v_~z$r_buff1_thd3~0_119) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~z$r_buff0_thd1~0_174 1) (= v_~z$r_buff0_thd1~0_175 v_~z$r_buff1_thd1~0_124) (= v_~z$w_buff0~0_445 2) (= v_~z$r_buff0_thd0~0_383 v_~z$r_buff1_thd0~0_369) (= v_~z$r_buff0_thd2~0_188 v_~z$r_buff1_thd2~0_189) (= v_~z$w_buff0~0_446 v_~z$w_buff1~0_402) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48| 0)) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|) (= 2 v_~x~0_160) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_643, ~z$w_buff0~0=v_~z$w_buff0~0_446, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_175, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_642, ~z$w_buff0~0=v_~z$w_buff0~0_445, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_189, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_592, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_48|, ~z$w_buff1~0=v_~z$w_buff1~0_402, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_383, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_48|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_369, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_124, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_112, ~y~0=v_~y~0_165, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_160, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_188} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P1Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~y~0, ~z$r_buff0_thd1~0, ~x~0] and [378] $Ultimate##0-->L789: Formula: (and (= v_~y~0_41 2) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y~0] [2022-12-13 00:54:35,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] $Ultimate##0-->L789: Formula: (and (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_60| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_60|) (= v_P2Thread1of1ForFork1_~arg.offset_29 |v_P2Thread1of1ForFork1_#in~arg.offset_29|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_58| |v_P0Thread1of1ForFork2_~arg#1.base_58|) (= 2 v_~x~0_172) (= v_~y~0_183 2) (= v_~z$r_buff0_thd0~0_395 v_~z$r_buff1_thd0~0_381) (= v_~z$r_buff0_thd1~0_203 v_~z$r_buff1_thd1~0_140) (= v_~z$w_buff0_used~0_677 v_~z$w_buff1_used~0_614) (= v_~z$w_buff0~0_469 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_29| v_P1Thread1of1ForFork0_~arg.offset_29) (= v_~z$w_buff0~0_470 v_~z$w_buff1~0_414) (= v_P1Thread1of1ForFork0_~arg.base_29 |v_P1Thread1of1ForFork0_#in~arg.base_29|) (= v_~z$w_buff0_used~0_676 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_58| |v_P0Thread1of1ForFork2_~arg#1.offset_58|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_60| 0)) (= v_~z$r_buff0_thd1~0_202 1) (= v_P2Thread1of1ForFork1_~arg.base_29 |v_P2Thread1of1ForFork1_#in~arg.base_29|) (= v_~z$r_buff0_thd3~0_130 v_~z$r_buff1_thd3~0_137) (= v_~z$r_buff0_thd2~0_204 v_~z$r_buff1_thd2~0_205) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_60| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_614 256) 0)) (not (= (mod v_~z$w_buff0_used~0_676 256) 0)))) 1 0))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_395, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_677, ~z$w_buff0~0=v_~z$w_buff0~0_470, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_58|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_29|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_29|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_58|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_203, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_204} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_60|, ~z$w_buff1~0=v_~z$w_buff1~0_414, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_58|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_58|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_395, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_60|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_29, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_29|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_381, ~y~0=v_~y~0_183, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_204, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_29, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_676, ~z$w_buff0~0=v_~z$w_buff0~0_469, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_58|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_137, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_614, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_58|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_29, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_140, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_29|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_202, ~x~0=v_~x~0_172} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~y~0, ~z$r_buff0_thd1~0, ~x~0] and [330] L772-->L779: Formula: (let ((.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_101 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_55 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_36 v_~z~0_56))) (= v_~z$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_97)) (= v_~z$w_buff0_used~0_101 (ite .cse0 0 v_~z$w_buff0_used~0_102)) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_20))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_102, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 00:54:36,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] $Ultimate##0-->L789: Formula: (and (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_60| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_60|) (= v_P2Thread1of1ForFork1_~arg.offset_29 |v_P2Thread1of1ForFork1_#in~arg.offset_29|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_58| |v_P0Thread1of1ForFork2_~arg#1.base_58|) (= 2 v_~x~0_172) (= v_~y~0_183 2) (= v_~z$r_buff0_thd0~0_395 v_~z$r_buff1_thd0~0_381) (= v_~z$r_buff0_thd1~0_203 v_~z$r_buff1_thd1~0_140) (= v_~z$w_buff0_used~0_677 v_~z$w_buff1_used~0_614) (= v_~z$w_buff0~0_469 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_29| v_P1Thread1of1ForFork0_~arg.offset_29) (= v_~z$w_buff0~0_470 v_~z$w_buff1~0_414) (= v_P1Thread1of1ForFork0_~arg.base_29 |v_P1Thread1of1ForFork0_#in~arg.base_29|) (= v_~z$w_buff0_used~0_676 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_58| |v_P0Thread1of1ForFork2_~arg#1.offset_58|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_60| 0)) (= v_~z$r_buff0_thd1~0_202 1) (= v_P2Thread1of1ForFork1_~arg.base_29 |v_P2Thread1of1ForFork1_#in~arg.base_29|) (= v_~z$r_buff0_thd3~0_130 v_~z$r_buff1_thd3~0_137) (= v_~z$r_buff0_thd2~0_204 v_~z$r_buff1_thd2~0_205) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_60| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_614 256) 0)) (not (= (mod v_~z$w_buff0_used~0_676 256) 0)))) 1 0))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_395, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_677, ~z$w_buff0~0=v_~z$w_buff0~0_470, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_58|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_29|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_29|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_58|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_203, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_204} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_60|, ~z$w_buff1~0=v_~z$w_buff1~0_414, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_58|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_58|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_395, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_60|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_29, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_29|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_381, ~y~0=v_~y~0_183, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_204, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_29, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_676, ~z$w_buff0~0=v_~z$w_buff0~0_469, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_58|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_137, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_614, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_58|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_29, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_140, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_29|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_202, ~x~0=v_~x~0_172} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~y~0, ~z$r_buff0_thd1~0, ~x~0] and [323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-13 00:54:36,379 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:54:36,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1850 [2022-12-13 00:54:36,380 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 326 flow [2022-12-13 00:54:36,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:36,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:36,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:36,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:54:36,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash 476164529, now seen corresponding path program 1 times [2022-12-13 00:54:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:36,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845139465] [2022-12-13 00:54:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:36,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:54:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:36,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:54:36,461 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:54:36,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:54:36,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:54:36,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:54:36,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:54:36,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:54:36,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:54:36,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:54:36,464 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:36,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:54:36,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:54:36,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:54:36 BasicIcfg [2022-12-13 00:54:36,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:54:36,524 INFO L158 Benchmark]: Toolchain (without parser) took 43835.85ms. Allocated memory was 205.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 180.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 86.2MB. Max. memory is 8.0GB. [2022-12-13 00:54:36,524 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:54:36,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.76ms. Allocated memory is still 205.5MB. Free memory was 179.9MB in the beginning and 153.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:54:36,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 205.5MB. Free memory was 153.7MB in the beginning and 151.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:36,525 INFO L158 Benchmark]: Boogie Preprocessor took 32.83ms. Allocated memory is still 205.5MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:36,525 INFO L158 Benchmark]: RCFGBuilder took 604.15ms. Allocated memory is still 205.5MB. Free memory was 149.5MB in the beginning and 114.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 00:54:36,525 INFO L158 Benchmark]: TraceAbstraction took 42696.41ms. Allocated memory was 205.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 113.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:36,526 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.76ms. Allocated memory is still 205.5MB. Free memory was 179.9MB in the beginning and 153.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 205.5MB. Free memory was 153.7MB in the beginning and 151.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.83ms. Allocated memory is still 205.5MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.15ms. Allocated memory is still 205.5MB. Free memory was 149.5MB in the beginning and 114.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 42696.41ms. Allocated memory was 205.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 113.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 111 PlacesBefore, 75 PlacesAfterwards, 103 TransitionsBefore, 65 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 3182, independent unconditional: 0, dependent: 248, dependent conditional: 248, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 0, independent unconditional: 3182, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 0, independent unconditional: 3182, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 0, independent unconditional: 3182, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1689, independent: 1635, independent conditional: 0, independent unconditional: 1635, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1689, independent: 1606, independent conditional: 0, independent unconditional: 1606, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 333, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 311, dependent conditional: 0, dependent unconditional: 311, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3430, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 1689, unknown conditional: 0, unknown unconditional: 1689] , Statistics on independence cache: Total cache size (in pairs): 3446, Positive cache size: 3392, Positive conditional cache size: 0, Positive unconditional cache size: 3392, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, 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, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 239, independent: 205, independent conditional: 205, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 239, independent: 205, independent conditional: 21, independent unconditional: 184, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 239, independent: 205, independent conditional: 21, independent unconditional: 184, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 239, independent: 205, independent conditional: 21, independent unconditional: 184, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 203, independent: 179, independent conditional: 20, independent unconditional: 159, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 203, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 75, dependent conditional: 29, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 239, independent: 26, independent conditional: 1, independent unconditional: 25, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 203, unknown conditional: 27, unknown unconditional: 176] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 179, Positive conditional cache size: 20, Positive unconditional cache size: 159, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, 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, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 75, independent conditional: 75, 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: 84, independent: 75, independent conditional: 12, independent unconditional: 63, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 75, independent conditional: 10, 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: 84, independent: 75, independent conditional: 10, 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: 4, independent: 4, independent conditional: 2, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 71, independent conditional: 8, independent unconditional: 63, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 183, Positive conditional cache size: 22, Positive unconditional cache size: 161, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 34, independent conditional: 34, 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: 40, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 34, independent conditional: 4, independent unconditional: 30, 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: 40, independent: 34, independent conditional: 4, independent unconditional: 30, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 30, independent conditional: 4, independent unconditional: 26, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 22, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 778 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 10, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 16, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 18, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 27, independent conditional: 21, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 27, independent conditional: 12, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 27, independent conditional: 12, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 30, independent: 27, independent conditional: 12, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 21, independent conditional: 6, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 6, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 24, independent: 21, independent conditional: 6, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1092 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 35, independent conditional: 10, independent unconditional: 25, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 10, independent unconditional: 25, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 40, independent: 35, independent conditional: 10, independent unconditional: 25, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 1184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 49, independent conditional: 35, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 49, independent conditional: 14, independent unconditional: 35, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 49, independent conditional: 14, independent unconditional: 35, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 56, independent: 49, independent conditional: 14, independent unconditional: 35, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, 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.3s, 74 PlacesBefore, 74 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, 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: 50, independent: 50, independent conditional: 32, independent unconditional: 18, 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: 50, independent: 50, independent conditional: 16, independent unconditional: 34, 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: 50, independent: 50, independent conditional: 16, independent unconditional: 34, 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: 7, independent: 7, independent conditional: 2, independent unconditional: 5, 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: 7, independent conditional: 0, independent unconditional: 7, 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: 50, independent: 43, independent conditional: 14, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 196, Positive conditional cache size: 24, Positive unconditional cache size: 172, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 196, Positive conditional cache size: 24, Positive unconditional cache size: 172, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, 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: 1.9s, 75 PlacesBefore, 69 PlacesAfterwards, 57 TransitionsBefore, 52 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 133, independent conditional: 129, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 133, independent conditional: 72, independent unconditional: 61, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 133, independent conditional: 72, independent unconditional: 61, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 47, independent conditional: 40, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 135, independent: 86, independent conditional: 32, independent unconditional: 54, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 48, unknown conditional: 40, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 276, Positive conditional cache size: 66, Positive unconditional cache size: 210, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 55 PlacesBefore, 52 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 71, independent conditional: 71, 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: 87, independent: 71, independent conditional: 66, independent unconditional: 5, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 71, independent conditional: 66, independent unconditional: 5, 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: 87, independent: 71, independent conditional: 66, independent unconditional: 5, 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: 12, independent conditional: 12, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 87, independent: 59, independent conditional: 54, independent unconditional: 5, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 13, unknown conditional: 12, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 297, Positive conditional cache size: 78, Positive unconditional cache size: 219, Negative cache size: 26, Negative conditional cache size: 7, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=2, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L768] 1 x = 2 [L771] 1 y = 1 [L788] 1 y = 2 [L791] 1 z = 1 [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L794] 1 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 1 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 1 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 819]: 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: 817]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 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: 42.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1034 IncrementalHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 14 mSDtfsCounter, 1034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=843occurred in iteration=10, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1315 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-13 00:54:36,562 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...