/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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:42:38,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:42:38,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:42:38,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:42:38,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:42:38,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:42:38,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:42:38,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:42:38,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:42:39,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:42:39,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:42:39,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:42:39,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:42:39,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:42:39,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:42:39,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:42:39,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:42:39,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:42:39,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:42:39,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:42:39,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:42:39,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:42:39,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:42:39,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:42:39,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:42:39,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:42:39,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:42:39,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:42:39,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:42:39,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:42:39,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:42:39,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:42:39,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:42:39,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:42:39,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:42:39,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:42:39,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:42:39,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:42:39,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:42:39,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:42:39,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:42:39,033 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:42:39,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:42:39,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:42:39,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:42:39,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:42:39,065 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:42:39,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:42:39,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:42:39,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:42:39,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:42:39,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:42:39,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:42:39,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:42:39,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:42:39,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:42:39,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:42:39,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:42:39,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:42:39,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:42:39,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:42:39,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:42:39,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:42:39,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:42:39,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:42:39,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:42:39,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:42:39,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:42:39,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:42:39,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:42:39,069 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:42:39,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:42:39,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:42:39,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:42:39,370 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:42:39,371 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:42:39,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:42:40,251 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:42:40,496 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:42:40,496 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:42:40,521 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe446b7f/8e15c104b87243a19ff05d60614e6370/FLAGb2f8cc696 [2022-12-13 00:42:40,533 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe446b7f/8e15c104b87243a19ff05d60614e6370 [2022-12-13 00:42:40,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:42:40,537 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:42:40,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:42:40,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:42:40,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:42:40,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:42:40" (1/1) ... [2022-12-13 00:42:40,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bce9297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:40, skipping insertion in model container [2022-12-13 00:42:40,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:42:40" (1/1) ... [2022-12-13 00:42:40,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:42:40,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:42:40,732 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 00:42:40,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:42:40,932 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:42:40,941 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 00:42:40,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:42:40,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:42:40,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:42:41,028 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:42:41,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41 WrapperNode [2022-12-13 00:42:41,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:42:41,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:42:41,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:42:41,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:42:41,035 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:42:41" (1/1) ... [2022-12-13 00:42:41,049 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:42:41" (1/1) ... [2022-12-13 00:42:41,066 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-12-13 00:42:41,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:42:41,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:42:41,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:42:41,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:42:41,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,097 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:42:41,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:42:41,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:42:41,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:42:41,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (1/1) ... [2022-12-13 00:42:41,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:42:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:42:41,138 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:42:41,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:42:41,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:42:41,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:42:41,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:42:41,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:42:41,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:42:41,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:42:41,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:42:41,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:42:41,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:42:41,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:42:41,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:42:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:42:41,159 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:42:41,176 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:42:41,341 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:42:41,342 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:42:41,604 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:42:41,681 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:42:41,681 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:42:41,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:42:41 BoogieIcfgContainer [2022-12-13 00:42:41,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:42:41,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:42:41,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:42:41,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:42:41,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:42:40" (1/3) ... [2022-12-13 00:42:41,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f55fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:42:41, skipping insertion in model container [2022-12-13 00:42:41,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:42:41" (2/3) ... [2022-12-13 00:42:41,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f55fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:42:41, skipping insertion in model container [2022-12-13 00:42:41,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:42:41" (3/3) ... [2022-12-13 00:42:41,689 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:42:41,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:42:41,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:42:41,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:42:41,740 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:42:41,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 00:42:41,820 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 00:42:41,821 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:42:41,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 00:42:41,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 00:42:41,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-13 00:42:41,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:41,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 00:42:41,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-13 00:42:41,868 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 00:42:41,868 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:42:41,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 00:42:41,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 00:42:41,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 00:42:47,345 INFO L241 LiptonReduction]: Total number of compositions: 74 [2022-12-13 00:42:47,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:42:47,360 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;@23a4f620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:42:47,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:42:47,363 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 00:42:47,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:42:47,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:47,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:42:47,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:47,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:47,368 INFO L85 PathProgramCache]: Analyzing trace with hash 410097211, now seen corresponding path program 1 times [2022-12-13 00:42:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:47,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065950882] [2022-12-13 00:42:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:47,641 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:42:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:47,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065950882] [2022-12-13 00:42:47,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065950882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:47,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:47,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:42:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488951546] [2022-12-13 00:42:47,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:47,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:42:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:42:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:42:47,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2022-12-13 00:42:47,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:42:47,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:47,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2022-12-13 00:42:47,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:48,052 INFO L130 PetriNetUnfolder]: 1366/2468 cut-off events. [2022-12-13 00:42:48,052 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:42:48,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 2468 events. 1366/2468 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16491 event pairs, 100 based on Foata normal form. 0/1357 useless extension candidates. Maximal degree in co-relation 4691. Up to 1987 conditions per place. [2022-12-13 00:42:48,060 INFO L137 encePairwiseOnDemand]: 41/48 looper letters, 21 selfloop transitions, 3 changer transitions 40/71 dead transitions. [2022-12-13 00:42:48,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 276 flow [2022-12-13 00:42:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:42:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:42:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-12-13 00:42:48,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 00:42:48,069 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 102 flow. Second operand 3 states and 92 transitions. [2022-12-13 00:42:48,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 276 flow [2022-12-13 00:42:48,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:42:48,073 INFO L231 Difference]: Finished difference. Result has 51 places, 24 transitions, 58 flow [2022-12-13 00:42:48,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=51, PETRI_TRANSITIONS=24} [2022-12-13 00:42:48,077 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2022-12-13 00:42:48,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:48,078 INFO L89 Accepts]: Start accepts. Operand has 51 places, 24 transitions, 58 flow [2022-12-13 00:42:48,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:48,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:48,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 24 transitions, 58 flow [2022-12-13 00:42:48,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 58 flow [2022-12-13 00:42:48,083 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 00:42:48,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:42:48,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:42:48,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 58 flow [2022-12-13 00:42:48,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 00:42:48,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:42:48,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 00:42:48,291 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 56 flow [2022-12-13 00:42:48,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:42:48,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:48,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:48,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:42:48,295 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1033519834, now seen corresponding path program 1 times [2022-12-13 00:42:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:48,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186245595] [2022-12-13 00:42:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:48,698 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:42:48,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:48,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186245595] [2022-12-13 00:42:48,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186245595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:48,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:48,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:42:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117183191] [2022-12-13 00:42:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:48,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:42:48,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:42:48,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:42:48,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 00:42:48,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:48,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:48,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 00:42:48,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:48,805 INFO L130 PetriNetUnfolder]: 231/429 cut-off events. [2022-12-13 00:42:48,805 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 00:42:48,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 429 events. 231/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1804 event pairs, 71 based on Foata normal form. 12/371 useless extension candidates. Maximal degree in co-relation 873. Up to 305 conditions per place. [2022-12-13 00:42:48,808 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 22 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2022-12-13 00:42:48,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 120 flow [2022-12-13 00:42:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:42:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:42:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 00:42:48,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2022-12-13 00:42:48,809 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 56 flow. Second operand 3 states and 41 transitions. [2022-12-13 00:42:48,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 120 flow [2022-12-13 00:42:48,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:42:48,810 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 56 flow [2022-12-13 00:42:48,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-13 00:42:48,811 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -23 predicate places. [2022-12-13 00:42:48,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:48,811 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 56 flow [2022-12-13 00:42:48,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:48,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:48,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 56 flow [2022-12-13 00:42:48,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 56 flow [2022-12-13 00:42:48,815 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 00:42:48,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:42:48,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:42:48,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 56 flow [2022-12-13 00:42:48,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 00:42:48,852 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:48,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 00:42:48,853 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 56 flow [2022-12-13 00:42:48,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:48,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:48,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:48,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:42:48,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:48,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1974342468, now seen corresponding path program 1 times [2022-12-13 00:42:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:48,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163747709] [2022-12-13 00:42:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:48,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:49,240 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:42:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:49,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163747709] [2022-12-13 00:42:49,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163747709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:49,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:49,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:42:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855800680] [2022-12-13 00:42:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:49,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:42:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:42:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:42:49,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:42:49,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:42:49,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:49,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:42:49,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:49,335 INFO L130 PetriNetUnfolder]: 168/343 cut-off events. [2022-12-13 00:42:49,335 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 00:42:49,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 343 events. 168/343 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1474 event pairs, 68 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 708. Up to 272 conditions per place. [2022-12-13 00:42:49,337 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 22 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2022-12-13 00:42:49,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 141 flow [2022-12-13 00:42:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:42:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:42:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 00:42:49,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-13 00:42:49,345 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 56 flow. Second operand 4 states and 53 transitions. [2022-12-13 00:42:49,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 141 flow [2022-12-13 00:42:49,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:42:49,347 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 92 flow [2022-12-13 00:42:49,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-13 00:42:49,348 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -21 predicate places. [2022-12-13 00:42:49,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:49,348 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 92 flow [2022-12-13 00:42:49,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:49,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:49,349 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 92 flow [2022-12-13 00:42:49,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 92 flow [2022-12-13 00:42:49,354 INFO L130 PetriNetUnfolder]: 9/59 cut-off events. [2022-12-13 00:42:49,354 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 00:42:49,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 59 events. 9/59 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 213 event pairs, 4 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 98. Up to 19 conditions per place. [2022-12-13 00:42:49,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 92 flow [2022-12-13 00:42:49,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 00:42:49,358 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:49,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 00:42:49,359 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 92 flow [2022-12-13 00:42:49,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:42:49,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:49,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:49,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:42:49,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:49,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1974139728, now seen corresponding path program 2 times [2022-12-13 00:42:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:49,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246921529] [2022-12-13 00:42:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:49,744 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:42:49,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:49,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246921529] [2022-12-13 00:42:49,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246921529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:49,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:49,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:42:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056381434] [2022-12-13 00:42:49,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:49,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:42:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:49,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:42:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:42:49,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:42:49,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:42:49,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:49,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:42:49,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:49,846 INFO L130 PetriNetUnfolder]: 164/337 cut-off events. [2022-12-13 00:42:49,847 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-13 00:42:49,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 337 events. 164/337 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1441 event pairs, 68 based on Foata normal form. 2/294 useless extension candidates. Maximal degree in co-relation 813. Up to 263 conditions per place. [2022-12-13 00:42:49,864 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 23 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2022-12-13 00:42:49,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 178 flow [2022-12-13 00:42:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:42:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:42:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 00:42:49,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-13 00:42:49,865 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 92 flow. Second operand 4 states and 53 transitions. [2022-12-13 00:42:49,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 178 flow [2022-12-13 00:42:49,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:42:49,868 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 125 flow [2022-12-13 00:42:49,868 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 00:42:49,869 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2022-12-13 00:42:49,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:49,869 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 125 flow [2022-12-13 00:42:49,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:49,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:49,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 125 flow [2022-12-13 00:42:49,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 125 flow [2022-12-13 00:42:49,876 INFO L130 PetriNetUnfolder]: 11/54 cut-off events. [2022-12-13 00:42:49,876 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-12-13 00:42:49,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 54 events. 11/54 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 183 event pairs, 3 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 120. Up to 18 conditions per place. [2022-12-13 00:42:49,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 125 flow [2022-12-13 00:42:49,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 00:42:49,909 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:49,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 00:42:49,914 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 125 flow [2022-12-13 00:42:49,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:42:49,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:49,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:49,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:42:49,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -571255236, now seen corresponding path program 1 times [2022-12-13 00:42:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:49,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627333152] [2022-12-13 00:42:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:50,110 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:42:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:50,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627333152] [2022-12-13 00:42:50,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627333152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:50,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:50,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:42:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37513758] [2022-12-13 00:42:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:50,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:42:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:50,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:42:50,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:42:50,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:42:50,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:42:50,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:50,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:42:50,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:50,246 INFO L130 PetriNetUnfolder]: 170/345 cut-off events. [2022-12-13 00:42:50,247 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-13 00:42:50,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 345 events. 170/345 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1482 event pairs, 31 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 925. Up to 246 conditions per place. [2022-12-13 00:42:50,262 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 29 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2022-12-13 00:42:50,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 250 flow [2022-12-13 00:42:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:42:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:42:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 00:42:50,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2022-12-13 00:42:50,266 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 125 flow. Second operand 5 states and 64 transitions. [2022-12-13 00:42:50,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 250 flow [2022-12-13 00:42:50,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:42:50,268 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 179 flow [2022-12-13 00:42:50,269 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-13 00:42:50,270 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2022-12-13 00:42:50,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:50,270 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 179 flow [2022-12-13 00:42:50,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:50,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:50,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 179 flow [2022-12-13 00:42:50,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 179 flow [2022-12-13 00:42:50,294 INFO L130 PetriNetUnfolder]: 24/90 cut-off events. [2022-12-13 00:42:50,295 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-13 00:42:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 90 events. 24/90 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 372 event pairs, 5 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 237. Up to 29 conditions per place. [2022-12-13 00:42:50,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 179 flow [2022-12-13 00:42:50,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 00:42:50,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] $Ultimate##0-->L775: Formula: (and (= v_~y~0_26 1) (= v_~x$r_buff1_thd1~0_79 v_~x$r_buff0_thd1~0_73) (= 2 v_~x$w_buff0~0_275) (= v_~x$r_buff0_thd0~0_258 v_~x$r_buff1_thd0~0_265) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_373 256) 0)) (not (= (mod v_~x$w_buff1_used~0_338 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|) (= v_~x$r_buff1_thd2~0_82 v_~x$r_buff0_thd2~0_101) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_16| |v_P1Thread1of1ForFork1_~arg#1.offset_16|) (= v_~y~0_26 v_~__unbuffered_p1_EAX~0_105) (= v_~x$r_buff0_thd2~0_100 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_16| |v_P1Thread1of1ForFork1_~arg#1.base_16|) (= v_~x$w_buff0_used~0_373 1) (= v_~x$w_buff0_used~0_374 v_~x$w_buff1_used~0_338) (= v_~x$w_buff0~0_276 v_~x$w_buff1~0_245) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_276, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_374, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_275, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_16|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_16|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_82, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_338, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_265, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_373, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_16|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_105, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [284] L744-->L751: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_39 (ite .cse0 v_~x$w_buff0~0_22 (ite .cse2 v_~x$w_buff1~0_17 v_~x~0_40))) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_71) v_~x$w_buff1_used~0_70) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:42:50,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [415] $Ultimate##0-->L751: Formula: (let ((.cse0 (= (mod v_~x$w_buff0_used~0_448 256) 0)) (.cse2 (not (= (mod v_~x$r_buff0_thd1~0_106 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_446 256) 0)))) (let ((.cse1 (and .cse2 .cse3)) (.cse4 (and (not .cse0) .cse2))) (and (= (ite .cse0 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_25| |v_P1Thread1of1ForFork1_~arg#1.offset_25|) (= (ite .cse1 0 v_~x$r_buff0_thd1~0_106) v_~x$r_buff0_thd1~0_105) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= v_~x$r_buff0_thd0~0_299 v_~x$r_buff1_thd0~0_306) (= v_~x$r_buff0_thd2~0_131 v_~x$r_buff1_thd2~0_103) (= v_~y~0_35 v_~__unbuffered_p1_EAX~0_124) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| 0)) (= v_~y~0_35 1) (= 2 v_~x$w_buff0~0_321) (= v_~x$r_buff1_thd1~0_113 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_404 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd1~0_105 256) 0)) .cse3)) 0 v_~x$r_buff0_thd1~0_106)) (= v_~x$r_buff0_thd2~0_130 1) (= v_~x$w_buff0~0_322 v_~x$w_buff1~0_285) (= v_~x~0_352 (ite .cse2 v_~x$w_buff0~0_321 (ite .cse4 v_~x$w_buff1~0_285 v_~x~0_353))) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_25| |v_P1Thread1of1ForFork1_~arg#1.base_25|) (= v_~x$w_buff1_used~0_404 (ite (or .cse1 .cse4) 0 v_~x$w_buff0_used~0_448)) (= v_~x$w_buff0_used~0_446 (ite .cse2 0 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_322, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_299, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_131, ~x~0=v_~x~0_353, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_448, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_25|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_321, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_299, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_105, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_25|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_285, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_404, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_130, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_306, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_446, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_25|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_124, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|, ~y~0=v_~y~0_35, ~x~0=v_~x~0_352} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0] [2022-12-13 00:42:50,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [414] $Ultimate##0-->L775: Formula: (and (= v_~y~0_26 1) (= v_~x$r_buff1_thd1~0_79 v_~x$r_buff0_thd1~0_73) (= 2 v_~x$w_buff0~0_275) (= v_~x$r_buff0_thd0~0_258 v_~x$r_buff1_thd0~0_265) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_373 256) 0)) (not (= (mod v_~x$w_buff1_used~0_338 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|) (= v_~x$r_buff1_thd2~0_82 v_~x$r_buff0_thd2~0_101) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_16| |v_P1Thread1of1ForFork1_~arg#1.offset_16|) (= v_~y~0_26 v_~__unbuffered_p1_EAX~0_105) (= v_~x$r_buff0_thd2~0_100 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_16| |v_P1Thread1of1ForFork1_~arg#1.base_16|) (= v_~x$w_buff0_used~0_373 1) (= v_~x$w_buff0_used~0_374 v_~x$w_buff1_used~0_338) (= v_~x$w_buff0~0_276 v_~x$w_buff1~0_245) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_276, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_374, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_275, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_16|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_16|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_82, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_338, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_265, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_373, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_16|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_105, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 00:42:50,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [196] L810-->L816: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_73 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd0~0_36 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_36 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_74 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd0~0_35 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_66 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_35 256) 0)))) 0 v_~x$r_buff1_thd0~0_36)) (= v_~x~0_35 (ite .cse2 v_~x$w_buff0~0_20 (ite .cse3 v_~x$w_buff1~0_15 v_~x~0_36))) (= (ite .cse2 0 v_~x$w_buff0_used~0_74) v_~x$w_buff0_used~0_73) (= v_~x$r_buff0_thd0~0_35 (ite .cse4 0 v_~x$r_buff0_thd0~0_36)) (= v_~x$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_67))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_36, ~x~0=v_~x~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_66, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_35, ~x~0=v_~x~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:42:51,020 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:42:51,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 751 [2022-12-13 00:42:51,021 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 194 flow [2022-12-13 00:42:51,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:42:51,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:51,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:51,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:42:51,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash 674518714, now seen corresponding path program 1 times [2022-12-13 00:42:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:51,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579896217] [2022-12-13 00:42:51,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:51,272 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:42:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:51,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579896217] [2022-12-13 00:42:51,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579896217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:51,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:51,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:42:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271970443] [2022-12-13 00:42:51,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:51,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:42:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:42:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:42:51,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 00:42:51,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:42:51,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:51,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 00:42:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:51,369 INFO L130 PetriNetUnfolder]: 168/333 cut-off events. [2022-12-13 00:42:51,370 INFO L131 PetriNetUnfolder]: For 586/586 co-relation queries the response was YES. [2022-12-13 00:42:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 333 events. 168/333 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1468 event pairs, 45 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 1091. Up to 247 conditions per place. [2022-12-13 00:42:51,372 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 30 selfloop transitions, 12 changer transitions 0/48 dead transitions. [2022-12-13 00:42:51,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 339 flow [2022-12-13 00:42:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:42:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:42:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 00:42:51,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2022-12-13 00:42:51,373 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 194 flow. Second operand 6 states and 73 transitions. [2022-12-13 00:42:51,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 339 flow [2022-12-13 00:42:51,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 322 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 00:42:51,375 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 237 flow [2022-12-13 00:42:51,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 00:42:51,376 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2022-12-13 00:42:51,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:51,376 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 237 flow [2022-12-13 00:42:51,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:51,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:51,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 237 flow [2022-12-13 00:42:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 237 flow [2022-12-13 00:42:51,385 INFO L130 PetriNetUnfolder]: 27/98 cut-off events. [2022-12-13 00:42:51,385 INFO L131 PetriNetUnfolder]: For 160/161 co-relation queries the response was YES. [2022-12-13 00:42:51,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 98 events. 27/98 cut-off events. For 160/161 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 444 event pairs, 6 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 288. Up to 33 conditions per place. [2022-12-13 00:42:51,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 237 flow [2022-12-13 00:42:51,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 00:42:51,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [196] L810-->L816: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_73 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd0~0_36 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_36 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_74 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd0~0_35 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_66 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_35 256) 0)))) 0 v_~x$r_buff1_thd0~0_36)) (= v_~x~0_35 (ite .cse2 v_~x$w_buff0~0_20 (ite .cse3 v_~x$w_buff1~0_15 v_~x~0_36))) (= (ite .cse2 0 v_~x$w_buff0_used~0_74) v_~x$w_buff0_used~0_73) (= v_~x$r_buff0_thd0~0_35 (ite .cse4 0 v_~x$r_buff0_thd0~0_36)) (= v_~x$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_67))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_36, ~x~0=v_~x~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_66, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_35, ~x~0=v_~x~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [284] L744-->L751: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_39 (ite .cse0 v_~x$w_buff0~0_22 (ite .cse2 v_~x$w_buff1~0_17 v_~x~0_40))) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_71) v_~x$w_buff1_used~0_70) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:42:51,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [196] L810-->L816: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_73 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd0~0_36 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_36 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_74 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd0~0_35 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_66 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_35 256) 0)))) 0 v_~x$r_buff1_thd0~0_36)) (= v_~x~0_35 (ite .cse2 v_~x$w_buff0~0_20 (ite .cse3 v_~x$w_buff1~0_15 v_~x~0_36))) (= (ite .cse2 0 v_~x$w_buff0_used~0_74) v_~x$w_buff0_used~0_73) (= v_~x$r_buff0_thd0~0_35 (ite .cse4 0 v_~x$r_buff0_thd0~0_36)) (= v_~x$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_67))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_36, ~x~0=v_~x~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_66, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_35, ~x~0=v_~x~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_60))) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:42:51,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L741-->L775: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_29| |v_P1Thread1of1ForFork1_~arg#1.offset_29|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff0_used~0_457 v_~x$w_buff1_used~0_410) (= v_~x~0_360 1) (= v_~x$r_buff0_thd0~0_303 v_~x$r_buff1_thd0~0_310) (= 2 v_~x$w_buff0~0_329) (= v_~x$w_buff0_used~0_456 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_29| |v_P1Thread1of1ForFork1_~arg#1.base_29|) (= v_~x$r_buff0_thd1~0_113 v_~x$r_buff1_thd1~0_119) (= v_~x$r_buff0_thd2~0_138 1) (= v_~x$w_buff0~0_330 v_~x$w_buff1~0_289) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_456 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_410 256))))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_39 1) (= v_~x$r_buff0_thd2~0_139 v_~x$r_buff1_thd2~0_107) (= v_~y~0_39 v_~__unbuffered_p1_EAX~0_128)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_330, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_303, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_139, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_457, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_29|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_329, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_303, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_113, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_29|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_289, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_107, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_410, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_119, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_310, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_456, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_29|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_29|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_128, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y~0=v_~y~0_39, ~x~0=v_~x~0_360} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0] and [421] L810-->L785: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd0~0_318 256) 0)))) (let ((.cse8 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_484 256) 0))))) (let ((.cse7 (ite .cse8 0 v_~x$w_buff0_used~0_484))) (let ((.cse12 (not (= (mod v_~x$r_buff1_thd0~0_324 256) 0))) (.cse10 (not (= (mod .cse7 256) 0)))) (let ((.cse5 (and .cse14 .cse10)) (.cse9 (and (not (= 0 (mod v_~x$w_buff1_used~0_434 256))) .cse12))) (let ((.cse4 (ite (or .cse5 .cse9) 0 v_~x$w_buff1_used~0_434))) (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_113 256) 0))) (.cse11 (not (= (mod .cse4 256) 0))) (.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_482 256)))) (.cse13 (not (= (mod v_~x$r_buff0_thd2~0_149 256) 0)))) (let ((.cse3 (and .cse0 .cse13)) (.cse6 (and .cse13 .cse10)) (.cse2 (and .cse1 .cse11))) (and (= v_~x$r_buff1_thd2~0_112 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd2~0_148 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_432 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_113)) (= (ite (or .cse2 .cse3) 0 .cse4) v_~x$w_buff1_used~0_432) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_149) v_~x$r_buff0_thd2~0_148) (= v_~x$r_buff0_thd0~0_317 (ite .cse5 0 v_~x$r_buff0_thd0~0_318)) (= (ite .cse6 0 .cse7) v_~x$w_buff0_used~0_482) (= (ite .cse6 v_~x$w_buff0~0_346 (ite .cse2 v_~x$w_buff1~0_301 (ite .cse8 v_~x$w_buff0~0_346 (ite .cse9 v_~x$w_buff1~0_301 v_~x~0_384)))) v_~x~0_382) (= v_~x$r_buff1_thd0~0_323 (ite (or (and (not (= 0 (mod v_~x$r_buff0_thd0~0_317 256))) .cse10) (and .cse11 .cse12)) 0 v_~x$r_buff1_thd0~0_324))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_318, ~x$w_buff1~0=v_~x$w_buff1~0_301, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_434, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_149, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x~0=v_~x~0_384, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_484} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ~x$w_buff1~0=v_~x$w_buff1~0_301, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_432, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_148, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_323, ~x~0=v_~x~0_382, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_482} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:42:51,985 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:42:51,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 610 [2022-12-13 00:42:51,986 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 247 flow [2022-12-13 00:42:51,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:42:51,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:51,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:51,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:42:51,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash 674313153, now seen corresponding path program 1 times [2022-12-13 00:42:51,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:51,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292141647] [2022-12-13 00:42:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:52,275 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:42:52,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:52,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292141647] [2022-12-13 00:42:52,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292141647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:52,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:52,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:42:52,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489206195] [2022-12-13 00:42:52,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:52,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:42:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:52,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:42:52,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:42:52,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 00:42:52,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:42:52,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:52,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 00:42:52,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:52,385 INFO L130 PetriNetUnfolder]: 177/356 cut-off events. [2022-12-13 00:42:52,385 INFO L131 PetriNetUnfolder]: For 904/904 co-relation queries the response was YES. [2022-12-13 00:42:52,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 356 events. 177/356 cut-off events. For 904/904 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1606 event pairs, 30 based on Foata normal form. 4/309 useless extension candidates. Maximal degree in co-relation 1211. Up to 219 conditions per place. [2022-12-13 00:42:52,389 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 30 selfloop transitions, 12 changer transitions 0/48 dead transitions. [2022-12-13 00:42:52,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 356 flow [2022-12-13 00:42:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:42:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:42:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-13 00:42:52,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-13 00:42:52,390 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 247 flow. Second operand 4 states and 60 transitions. [2022-12-13 00:42:52,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 356 flow [2022-12-13 00:42:52,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 335 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 00:42:52,394 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 260 flow [2022-12-13 00:42:52,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 00:42:52,395 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2022-12-13 00:42:52,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:52,395 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 260 flow [2022-12-13 00:42:52,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:52,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:52,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 260 flow [2022-12-13 00:42:52,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 260 flow [2022-12-13 00:42:52,408 INFO L130 PetriNetUnfolder]: 25/102 cut-off events. [2022-12-13 00:42:52,408 INFO L131 PetriNetUnfolder]: For 176/177 co-relation queries the response was YES. [2022-12-13 00:42:52,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 102 events. 25/102 cut-off events. For 176/177 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 484 event pairs, 5 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 311. Up to 31 conditions per place. [2022-12-13 00:42:52,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 260 flow [2022-12-13 00:42:52,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 00:42:52,411 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:52,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 00:42:52,412 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 260 flow [2022-12-13 00:42:52,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:42:52,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:52,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:52,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:42:52,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash 674525658, now seen corresponding path program 1 times [2022-12-13 00:42:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:52,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330132130] [2022-12-13 00:42:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:52,805 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:42:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:52,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330132130] [2022-12-13 00:42:52,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330132130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:52,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:52,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:42:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701100289] [2022-12-13 00:42:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:52,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:42:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:42:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:42:52,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 00:42:52,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:42:52,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:52,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 00:42:52,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:52,916 INFO L130 PetriNetUnfolder]: 191/392 cut-off events. [2022-12-13 00:42:52,916 INFO L131 PetriNetUnfolder]: For 1115/1115 co-relation queries the response was YES. [2022-12-13 00:42:52,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 392 events. 191/392 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1869 event pairs, 30 based on Foata normal form. 3/340 useless extension candidates. Maximal degree in co-relation 1401. Up to 272 conditions per place. [2022-12-13 00:42:52,920 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 34 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2022-12-13 00:42:52,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 397 flow [2022-12-13 00:42:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:42:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:42:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 00:42:52,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-13 00:42:52,921 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 260 flow. Second operand 4 states and 57 transitions. [2022-12-13 00:42:52,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 397 flow [2022-12-13 00:42:52,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:42:52,924 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 296 flow [2022-12-13 00:42:52,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-13 00:42:52,926 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-12-13 00:42:52,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:52,926 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 296 flow [2022-12-13 00:42:52,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:52,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:52,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 296 flow [2022-12-13 00:42:52,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 296 flow [2022-12-13 00:42:52,938 INFO L130 PetriNetUnfolder]: 25/110 cut-off events. [2022-12-13 00:42:52,939 INFO L131 PetriNetUnfolder]: For 250/251 co-relation queries the response was YES. [2022-12-13 00:42:52,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 110 events. 25/110 cut-off events. For 250/251 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 555 event pairs, 5 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 349. Up to 34 conditions per place. [2022-12-13 00:42:52,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 296 flow [2022-12-13 00:42:52,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 00:42:52,942 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:52,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 00:42:52,944 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 296 flow [2022-12-13 00:42:52,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:42:52,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:52,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:52,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:42:52,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -564489982, now seen corresponding path program 1 times [2022-12-13 00:42:52,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:52,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071285342] [2022-12-13 00:42:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:53,382 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:42:53,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:53,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071285342] [2022-12-13 00:42:53,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071285342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:53,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:53,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:42:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069309589] [2022-12-13 00:42:53,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:53,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:42:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:42:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:42:53,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 00:42:53,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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:42:53,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:53,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 00:42:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:53,540 INFO L130 PetriNetUnfolder]: 196/405 cut-off events. [2022-12-13 00:42:53,541 INFO L131 PetriNetUnfolder]: For 1477/1477 co-relation queries the response was YES. [2022-12-13 00:42:53,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 405 events. 196/405 cut-off events. For 1477/1477 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1966 event pairs, 30 based on Foata normal form. 3/351 useless extension candidates. Maximal degree in co-relation 1529. Up to 286 conditions per place. [2022-12-13 00:42:53,543 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 33 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2022-12-13 00:42:53,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 467 flow [2022-12-13 00:42:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:42:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:42:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-13 00:42:53,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-13 00:42:53,544 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 296 flow. Second operand 5 states and 65 transitions. [2022-12-13 00:42:53,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 467 flow [2022-12-13 00:42:53,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 447 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 00:42:53,548 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 368 flow [2022-12-13 00:42:53,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-13 00:42:53,549 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2022-12-13 00:42:53,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:53,549 INFO L89 Accepts]: Start accepts. Operand has 50 places, 44 transitions, 368 flow [2022-12-13 00:42:53,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:53,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:53,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 368 flow [2022-12-13 00:42:53,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 368 flow [2022-12-13 00:42:53,563 INFO L130 PetriNetUnfolder]: 26/117 cut-off events. [2022-12-13 00:42:53,563 INFO L131 PetriNetUnfolder]: For 346/347 co-relation queries the response was YES. [2022-12-13 00:42:53,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 117 events. 26/117 cut-off events. For 346/347 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 611 event pairs, 5 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 407. Up to 38 conditions per place. [2022-12-13 00:42:53,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 368 flow [2022-12-13 00:42:53,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-13 00:42:53,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [419] L741-->L816: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_464 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_313 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_306 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_465 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_417 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~x$r_buff0_thd0~0_305 (ite .cse0 0 v_~x$r_buff0_thd0~0_306)) (= v_~x$w_buff0_used~0_464 (ite .cse1 0 v_~x$w_buff0_used~0_465)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_305 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_416 256) 0)))) 0 v_~x$r_buff1_thd0~0_313) v_~x$r_buff1_thd0~0_312) (= (ite .cse1 v_~x$w_buff0~0_335 (ite .cse4 v_~x$w_buff1~0_293 1)) v_~x~0_366) (= (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_417) v_~x$w_buff1_used~0_416)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_306, ~x$w_buff1~0=v_~x$w_buff1~0_293, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_417, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_313, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_465} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_305, ~x$w_buff1~0=v_~x$w_buff1~0_293, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_416, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_312, ~x~0=v_~x~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_464} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [284] L744-->L751: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_39 (ite .cse0 v_~x$w_buff0~0_22 (ite .cse2 v_~x$w_buff1~0_17 v_~x~0_40))) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_71) v_~x$w_buff1_used~0_70) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:42:53,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [419] L741-->L816: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_464 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_313 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_306 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_465 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_417 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~x$r_buff0_thd0~0_305 (ite .cse0 0 v_~x$r_buff0_thd0~0_306)) (= v_~x$w_buff0_used~0_464 (ite .cse1 0 v_~x$w_buff0_used~0_465)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_305 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_416 256) 0)))) 0 v_~x$r_buff1_thd0~0_313) v_~x$r_buff1_thd0~0_312) (= (ite .cse1 v_~x$w_buff0~0_335 (ite .cse4 v_~x$w_buff1~0_293 1)) v_~x~0_366) (= (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_417) v_~x$w_buff1_used~0_416)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_306, ~x$w_buff1~0=v_~x$w_buff1~0_293, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_417, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_313, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_465} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_305, ~x$w_buff1~0=v_~x$w_buff1~0_293, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_416, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_312, ~x~0=v_~x~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_464} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [414] $Ultimate##0-->L775: Formula: (and (= v_~y~0_26 1) (= v_~x$r_buff1_thd1~0_79 v_~x$r_buff0_thd1~0_73) (= 2 v_~x$w_buff0~0_275) (= v_~x$r_buff0_thd0~0_258 v_~x$r_buff1_thd0~0_265) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_373 256) 0)) (not (= (mod v_~x$w_buff1_used~0_338 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|) (= v_~x$r_buff1_thd2~0_82 v_~x$r_buff0_thd2~0_101) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_16| |v_P1Thread1of1ForFork1_~arg#1.offset_16|) (= v_~y~0_26 v_~__unbuffered_p1_EAX~0_105) (= v_~x$r_buff0_thd2~0_100 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_16| |v_P1Thread1of1ForFork1_~arg#1.base_16|) (= v_~x$w_buff0_used~0_373 1) (= v_~x$w_buff0_used~0_374 v_~x$w_buff1_used~0_338) (= v_~x$w_buff0~0_276 v_~x$w_buff1~0_245) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_276, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_374, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_275, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_16|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_16|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_82, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_338, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_265, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_26|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_373, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_16|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_105, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_26|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 00:42:53,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:42:53,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-13 00:42:53,915 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 371 flow [2022-12-13 00:42:53,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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:42:53,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:53,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:53,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:42:53,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1032355131, now seen corresponding path program 1 times [2022-12-13 00:42:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:53,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161772314] [2022-12-13 00:42:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:53,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:54,033 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:42:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:54,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161772314] [2022-12-13 00:42:54,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161772314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:54,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:54,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:42:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396806915] [2022-12-13 00:42:54,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:54,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:42:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:54,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:42:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:42:54,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2022-12-13 00:42:54,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:54,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:54,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2022-12-13 00:42:54,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:54,091 INFO L130 PetriNetUnfolder]: 146/318 cut-off events. [2022-12-13 00:42:54,091 INFO L131 PetriNetUnfolder]: For 1294/1294 co-relation queries the response was YES. [2022-12-13 00:42:54,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 318 events. 146/318 cut-off events. For 1294/1294 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1454 event pairs, 36 based on Foata normal form. 13/256 useless extension candidates. Maximal degree in co-relation 1332. Up to 274 conditions per place. [2022-12-13 00:42:54,093 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 35 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2022-12-13 00:42:54,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 426 flow [2022-12-13 00:42:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:42:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:42:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 00:42:54,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 00:42:54,094 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 371 flow. Second operand 3 states and 48 transitions. [2022-12-13 00:42:54,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 426 flow [2022-12-13 00:42:54,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 377 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 00:42:54,096 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 267 flow [2022-12-13 00:42:54,097 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-13 00:42:54,097 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-12-13 00:42:54,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:54,097 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 267 flow [2022-12-13 00:42:54,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:54,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:54,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 267 flow [2022-12-13 00:42:54,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 267 flow [2022-12-13 00:42:54,113 INFO L130 PetriNetUnfolder]: 53/183 cut-off events. [2022-12-13 00:42:54,113 INFO L131 PetriNetUnfolder]: For 378/384 co-relation queries the response was YES. [2022-12-13 00:42:54,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 183 events. 53/183 cut-off events. For 378/384 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1007 event pairs, 9 based on Foata normal form. 6/145 useless extension candidates. Maximal degree in co-relation 699. Up to 82 conditions per place. [2022-12-13 00:42:54,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 267 flow [2022-12-13 00:42:54,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-13 00:42:54,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:42:54,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 00:42:54,210 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 269 flow [2022-12-13 00:42:54,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:54,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:54,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:54,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:42:54,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1782677666, now seen corresponding path program 1 times [2022-12-13 00:42:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:54,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146141727] [2022-12-13 00:42:54,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:54,298 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:42:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:54,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146141727] [2022-12-13 00:42:54,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146141727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:54,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:54,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:42:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407663109] [2022-12-13 00:42:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:54,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:42:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:54,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:42:54,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:42:54,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 00:42:54,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:54,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:54,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 00:42:54,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:54,353 INFO L130 PetriNetUnfolder]: 44/144 cut-off events. [2022-12-13 00:42:54,353 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2022-12-13 00:42:54,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 144 events. 44/144 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 603 event pairs, 6 based on Foata normal form. 30/136 useless extension candidates. Maximal degree in co-relation 611. Up to 61 conditions per place. [2022-12-13 00:42:54,354 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 27 selfloop transitions, 13 changer transitions 1/46 dead transitions. [2022-12-13 00:42:54,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 390 flow [2022-12-13 00:42:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:42:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:42:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 00:42:54,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-13 00:42:54,355 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 269 flow. Second operand 4 states and 54 transitions. [2022-12-13 00:42:54,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 390 flow [2022-12-13 00:42:54,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 337 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 00:42:54,357 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 241 flow [2022-12-13 00:42:54,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-13 00:42:54,358 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2022-12-13 00:42:54,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:54,358 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 241 flow [2022-12-13 00:42:54,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:54,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:54,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 241 flow [2022-12-13 00:42:54,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 241 flow [2022-12-13 00:42:54,384 INFO L130 PetriNetUnfolder]: 14/89 cut-off events. [2022-12-13 00:42:54,384 INFO L131 PetriNetUnfolder]: For 76/82 co-relation queries the response was YES. [2022-12-13 00:42:54,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 89 events. 14/89 cut-off events. For 76/82 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 384 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 251. Up to 46 conditions per place. [2022-12-13 00:42:54,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 241 flow [2022-12-13 00:42:54,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 00:42:55,415 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:42:55,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1057 [2022-12-13 00:42:55,415 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 237 flow [2022-12-13 00:42:55,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:55,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:55,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:55,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:42:55,416 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:42:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash 104695782, now seen corresponding path program 1 times [2022-12-13 00:42:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:55,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917155219] [2022-12-13 00:42:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:07,679 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:43:07,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:07,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917155219] [2022-12-13 00:43:07,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917155219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:07,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:07,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:43:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891039267] [2022-12-13 00:43:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:07,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:43:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:43:07,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:43:07,680 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 00:43:07,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:07,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:07,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 00:43:07,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:07,810 INFO L130 PetriNetUnfolder]: 63/176 cut-off events. [2022-12-13 00:43:07,810 INFO L131 PetriNetUnfolder]: For 355/367 co-relation queries the response was YES. [2022-12-13 00:43:07,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 176 events. 63/176 cut-off events. For 355/367 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 755 event pairs, 4 based on Foata normal form. 21/166 useless extension candidates. Maximal degree in co-relation 714. Up to 96 conditions per place. [2022-12-13 00:43:07,811 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 23 selfloop transitions, 3 changer transitions 29/60 dead transitions. [2022-12-13 00:43:07,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 508 flow [2022-12-13 00:43:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:43:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:43:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 00:43:07,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-13 00:43:07,812 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 237 flow. Second operand 6 states and 61 transitions. [2022-12-13 00:43:07,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 508 flow [2022-12-13 00:43:07,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 437 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-13 00:43:07,814 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 156 flow [2022-12-13 00:43:07,814 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2022-12-13 00:43:07,814 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-12-13 00:43:07,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:07,814 INFO L89 Accepts]: Start accepts. Operand has 47 places, 28 transitions, 156 flow [2022-12-13 00:43:07,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:07,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:07,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 28 transitions, 156 flow [2022-12-13 00:43:07,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 156 flow [2022-12-13 00:43:07,821 INFO L130 PetriNetUnfolder]: 11/60 cut-off events. [2022-12-13 00:43:07,821 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-13 00:43:07,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 60 events. 11/60 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 190 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 165. Up to 28 conditions per place. [2022-12-13 00:43:07,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 156 flow [2022-12-13 00:43:07,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 00:43:08,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [428] $Ultimate##0-->L778: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_38| |v_P1Thread1of1ForFork1_~arg#1.offset_38|) (= v_~y~0_48 v_~__unbuffered_p1_EAX~0_139) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_38| |v_P1Thread1of1ForFork1_~arg#1.base_38|) (= v_~x$r_buff0_thd2~0_163 v_~x$r_buff1_thd2~0_122) (= v_~x$w_buff0~0_367 v_~x$w_buff1~0_319) (= 2 v_~x$w_buff0~0_366) (= v_~x$w_buff0_used~0_520 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_468 256))) (not (= (mod v_~x$w_buff0_used~0_520 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~x$r_buff0_thd0~0_347 v_~x$r_buff1_thd0~0_355) (= v_~x$w_buff0_used~0_521 v_~x$w_buff1_used~0_468) (= v_~x$r_buff0_thd1~0_137 v_~x$r_buff1_thd1~0_143) (= v_~z~0_40 v_~__unbuffered_p1_EBX~0_126) (= v_~x$r_buff0_thd2~0_162 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= v_~y~0_48 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_367, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_38|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_347, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, ~z~0=v_~z~0_40, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_521, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_38|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_366, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_347, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_38|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_38|, ~x$w_buff1~0=v_~x$w_buff1~0_319, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_122, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_468, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_143, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_355, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_520, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_38|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_38|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|, ~z~0=v_~z~0_40, ~y~0=v_~y~0_48} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [431] $Ultimate##0-->L744: Formula: (and (= v_~z~0_46 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~x~0_418 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~z~0=v_~z~0_46, ~x~0=v_~x~0_418, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~z~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 00:43:08,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] $Ultimate##0-->L744: Formula: (and (= v_~z~0_48 1) (= v_~y~0_52 v_~__unbuffered_p1_EAX~0_143) (= v_~x~0_420 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_42| |v_P1Thread1of1ForFork1_~arg#1.base_42|) (= v_~y~0_52 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_42| |v_P1Thread1of1ForFork1_~arg#1.offset_42|) (= v_~x$w_buff0_used~0_530 1) (= v_~x$w_buff0_used~0_531 v_~x$w_buff1_used~0_474) (= v_~x$r_buff0_thd2~0_173 v_~x$r_buff1_thd2~0_128) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_52| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|) (= v_~z~0_49 v_~__unbuffered_p1_EBX~0_130) (= v_~x$r_buff0_thd0~0_351 v_~x$r_buff1_thd0~0_359) (= v_~x$w_buff0~0_375 v_~x$w_buff1~0_323) (= 2 v_~x$w_buff0~0_374) (= v_P0Thread1of1ForFork0_~arg.base_17 |v_P0Thread1of1ForFork0_#in~arg.base_17|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_474 256) 0)) (not (= (mod v_~x$w_buff0_used~0_530 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_52| 0)) (= v_~x$r_buff0_thd2~0_172 1) (= v_P0Thread1of1ForFork0_~arg.offset_17 |v_P0Thread1of1ForFork0_#in~arg.offset_17|) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_147)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_375, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_351, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_17|, ~z~0=v_~z~0_49, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_173, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_531, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_374, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_42|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_147, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_17, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_143, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|, ~y~0=v_~y~0_52, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_17, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_351, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_130, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_42|, ~x$w_buff1~0=v_~x$w_buff1~0_323, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_17|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_128, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_474, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_172, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_359, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_52|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_530, ~z~0=v_~z~0_48, ~x~0=v_~x~0_420} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z~0, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_60))) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:43:08,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] $Ultimate##0-->L751: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_540 256) 0))) (.cse2 (not (= (mod v_~x$r_buff0_thd1~0_146 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_542 256) 0))) (let ((.cse0 (and .cse2 (not .cse3))) (.cse1 (and .cse2 .cse4))) (and (= 2 v_~x$w_buff0~0_382) (= v_~x$w_buff1_used~0_480 (ite (or .cse0 .cse1) 0 v_~x$w_buff0_used~0_542)) (= v_~x$w_buff0~0_383 v_~x$w_buff1~0_327) (= (ite .cse2 v_~x$w_buff0~0_382 (ite .cse0 v_~x$w_buff1~0_327 1)) v_~x~0_426) (= v_~y~0_56 v_~__unbuffered_p1_EAX~0_147) (= v_~x$r_buff0_thd2~0_182 1) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_145 256) 0)) .cse4) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_480 256) 0)))) 0 v_~x$r_buff0_thd1~0_146) v_~x$r_buff1_thd1~0_151) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_46| |v_P1Thread1of1ForFork1_~arg#1.base_46|) (= v_~x$r_buff0_thd2~0_183 v_~x$r_buff1_thd2~0_134) (= v_~z~0_57 v_~__unbuffered_p1_EBX~0_134) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| 0)) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_46| |v_P1Thread1of1ForFork1_~arg#1.offset_46|) (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$r_buff0_thd0~0_355 v_~x$r_buff1_thd0~0_363) (= v_~z~0_56 1) (= v_~x$w_buff0_used~0_540 (ite .cse2 0 1)) (= v_~x$r_buff0_thd1~0_145 (ite .cse1 0 v_~x$r_buff0_thd1~0_146)) (= v_~y~0_56 1)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_383, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_46|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_355, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_146, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z~0=v_~z~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_183, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_46|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_382, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_145, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_46|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_151, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_46|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_46|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_147, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|, ~y~0=v_~y~0_56, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_355, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_134, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_46|, ~x$w_buff1~0=v_~x$w_buff1~0_327, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_480, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_182, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_363, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_540, ~z~0=v_~z~0_56, ~x~0=v_~x~0_426} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z~0, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_60))) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:43:09,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] $Ultimate##0-->L785: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_536 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_534 256) 0))) (.cse1 (not (= (mod v_~x$r_buff0_thd2~0_178 256) 0)))) (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0~0_378 v_~x~0_422) (= v_~y~0_54 1) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= v_~x$w_buff0~0_379 v_~x$w_buff1~0_325) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_44| |v_P1Thread1of1ForFork1_~arg#1.base_44|) (= v_~x$w_buff1_used~0_476 (ite (or .cse0 (and .cse1 (not .cse2))) 0 v_~x$w_buff0_used~0_536)) (= v_~z~0_53 v_~__unbuffered_p1_EBX~0_132) (= v_~x$w_buff0_used~0_534 0) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~x$r_buff0_thd0~0_353 v_~x$r_buff1_thd0~0_361) (= v_~x$r_buff0_thd1~0_143 v_~x$r_buff1_thd1~0_149) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_44| |v_P1Thread1of1ForFork1_~arg#1.offset_44|) (= (ite .cse0 0 1) v_~x$r_buff0_thd2~0_176) (= v_~z~0_52 1) (= v_~y~0_54 v_~__unbuffered_p1_EAX~0_145) (= v_~x$r_buff1_thd2~0_130 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_176 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_476 256) 0)))) 0 v_~x$r_buff0_thd2~0_178)) (= 2 v_~x$w_buff0~0_378))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_379, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_44|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_353, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~z~0=v_~z~0_53, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_178, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_536, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_44|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_378, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_44|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_149, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_44|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_44|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y~0=v_~y~0_54, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_353, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_132, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_44|, ~x$w_buff1~0=v_~x$w_buff1~0_325, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_476, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_176, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_361, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_534, ~z~0=v_~z~0_52, ~x~0=v_~x~0_422} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z~0, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [284] L744-->L751: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_39 (ite .cse0 v_~x$w_buff0~0_22 (ite .cse2 v_~x$w_buff1~0_17 v_~x~0_40))) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_71) v_~x$w_buff1_used~0_70) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:43:09,343 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 00:43:09,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1531 [2022-12-13 00:43:09,345 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 149 flow [2022-12-13 00:43:09,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:09,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:09,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:43:09,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:43:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1973128527, now seen corresponding path program 1 times [2022-12-13 00:43:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:09,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669300680] [2022-12-13 00:43:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:43:09,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:43:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:43:09,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:43:09,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:43:09,418 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:43:09,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 00:43:09,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:43:09,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:43:09,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 00:43:09,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:43:09,420 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:09,424 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:43:09,424 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:43:09,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:43:09 BasicIcfg [2022-12-13 00:43:09,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:43:09,474 INFO L158 Benchmark]: Toolchain (without parser) took 28937.12ms. Allocated memory was 168.8MB in the beginning and 906.0MB in the end (delta: 737.1MB). Free memory was 142.9MB in the beginning and 767.5MB in the end (delta: -624.6MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. [2022-12-13 00:43:09,474 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:43:09,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.27ms. Allocated memory is still 168.8MB. Free memory was 142.9MB in the beginning and 117.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 00:43:09,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.61ms. Allocated memory is still 168.8MB. Free memory was 117.3MB in the beginning and 114.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:43:09,474 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 168.8MB. Free memory was 114.6MB in the beginning and 113.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 00:43:09,475 INFO L158 Benchmark]: RCFGBuilder took 582.06ms. Allocated memory is still 168.8MB. Free memory was 113.1MB in the beginning and 81.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 00:43:09,475 INFO L158 Benchmark]: TraceAbstraction took 27789.02ms. Allocated memory was 168.8MB in the beginning and 906.0MB in the end (delta: 737.1MB). Free memory was 80.6MB in the beginning and 767.5MB in the end (delta: -687.0MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. [2022-12-13 00:43:09,476 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.27ms. Allocated memory is still 168.8MB. Free memory was 142.9MB in the beginning and 117.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.61ms. Allocated memory is still 168.8MB. Free memory was 117.3MB in the beginning and 114.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 168.8MB. Free memory was 114.6MB in the beginning and 113.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 582.06ms. Allocated memory is still 168.8MB. Free memory was 113.1MB in the beginning and 81.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 27789.02ms. Allocated memory was 168.8MB in the beginning and 906.0MB in the end (delta: 737.1MB). Free memory was 80.6MB in the beginning and 767.5MB in the end (delta: -687.0MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 94 PlacesBefore, 54 PlacesAfterwards, 89 TransitionsBefore, 48 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 3 ChoiceCompositions, 74 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2002, independent: 1902, independent conditional: 1902, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2002, independent: 1902, independent conditional: 0, independent unconditional: 1902, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2002, independent: 1902, independent conditional: 0, independent unconditional: 1902, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2002, independent: 1902, independent conditional: 0, independent unconditional: 1902, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1108, independent: 1070, independent conditional: 0, independent unconditional: 1070, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1108, independent: 1056, independent conditional: 0, independent unconditional: 1056, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2002, independent: 832, independent conditional: 0, independent unconditional: 832, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 1108, unknown conditional: 0, unknown unconditional: 1108] , Statistics on independence cache: Total cache size (in pairs): 2085, Positive cache size: 2047, Positive conditional cache size: 0, Positive unconditional cache size: 2047, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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.2s, 31 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 215, independent: 166, independent conditional: 166, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 215, independent: 166, independent conditional: 12, independent unconditional: 154, dependent: 49, dependent conditional: 2, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 215, independent: 166, independent conditional: 12, independent unconditional: 154, dependent: 49, dependent conditional: 2, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 215, independent: 166, independent conditional: 12, independent unconditional: 154, dependent: 49, dependent conditional: 2, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 7, independent unconditional: 78, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 105, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 81, dependent conditional: 10, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 215, independent: 81, independent conditional: 5, independent unconditional: 76, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 105, unknown conditional: 9, unknown unconditional: 96] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 85, Positive conditional cache size: 7, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, 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, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 7, independent unconditional: 71, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 122, Positive conditional cache size: 7, Positive unconditional cache size: 115, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 65, independent conditional: 65, 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: 81, independent: 65, independent conditional: 9, independent unconditional: 56, 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: 81, independent: 65, independent conditional: 5, independent unconditional: 60, 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: 81, independent: 65, independent conditional: 5, independent unconditional: 60, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 81, independent: 65, independent conditional: 5, independent unconditional: 60, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 7, Positive unconditional cache size: 115, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 96, independent conditional: 8, independent unconditional: 88, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 96, independent conditional: 6, independent unconditional: 90, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 96, independent conditional: 6, independent unconditional: 90, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 91, independent conditional: 6, independent unconditional: 85, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 127, Positive conditional cache size: 7, Positive unconditional cache size: 120, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, 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.7s, 41 PlacesBefore, 40 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, independent: 193, independent conditional: 193, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 230, independent: 193, independent conditional: 57, independent unconditional: 136, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 230, independent: 193, independent conditional: 25, independent unconditional: 168, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 193, independent conditional: 25, independent unconditional: 168, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 189, independent conditional: 25, independent unconditional: 164, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 150, Positive conditional cache size: 7, Positive unconditional cache size: 143, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 45 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 256, independent: 212, independent conditional: 212, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 256, independent: 212, independent conditional: 34, independent unconditional: 178, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 256, independent: 212, independent conditional: 20, independent unconditional: 192, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 256, independent: 212, independent conditional: 20, independent unconditional: 192, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, independent: 210, independent conditional: 18, independent unconditional: 192, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 157, Positive conditional cache size: 9, Positive unconditional cache size: 148, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 86, independent conditional: 15, independent unconditional: 71, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 86, independent conditional: 7, independent unconditional: 79, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 86, independent conditional: 7, independent unconditional: 79, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 105, independent: 86, independent conditional: 7, independent unconditional: 79, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 157, Positive conditional cache size: 9, Positive unconditional cache size: 148, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, 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, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 17, independent unconditional: 66, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 83, independent conditional: 7, independent unconditional: 76, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 7, independent unconditional: 76, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 104, independent: 83, independent conditional: 7, independent unconditional: 76, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 157, Positive conditional cache size: 9, Positive unconditional cache size: 148, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 50 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 278, independent: 220, independent conditional: 220, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 278, independent: 220, independent conditional: 46, independent unconditional: 174, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 278, independent: 220, independent conditional: 46, independent unconditional: 174, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 278, independent: 220, independent conditional: 46, independent unconditional: 174, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 278, independent: 219, independent conditional: 45, independent unconditional: 174, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 161, Positive conditional cache size: 10, Positive unconditional cache size: 151, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, 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.1s, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 120, independent conditional: 13, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 120, independent conditional: 13, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 120, independent conditional: 13, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 150, independent: 120, independent conditional: 13, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 168, Positive conditional cache size: 10, Positive unconditional cache size: 158, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 45 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 108, independent conditional: 68, independent unconditional: 40, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 108, independent conditional: 50, independent unconditional: 58, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 108, independent conditional: 50, independent unconditional: 58, dependent: 28, dependent conditional: 0, dependent unconditional: 28, 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: 136, independent: 108, independent conditional: 50, independent unconditional: 58, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 177, Positive conditional cache size: 10, Positive unconditional cache size: 167, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 41 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 22 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 21, independent unconditional: 5, 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: 26, independent: 26, independent conditional: 21, independent unconditional: 5, 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: 26, independent: 26, independent conditional: 21, independent unconditional: 5, 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: 10, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 26, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 229, Positive conditional cache size: 19, Positive unconditional cache size: 210, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=0, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=1, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z [L740] 2 z = 1 [L743] 2 x = 1 [L746] 2 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 2 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 2 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 805]: 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: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 747 IncrementalHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 12 mSDtfsCounter, 747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=9, InterpolantAutomatonStates: 51, 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, 15.1s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 1362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:43:09,508 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...