/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:21:54,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:21:54,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:21:54,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:21:54,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:21:55,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:21:55,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:21:55,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:21:55,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:21:55,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:21:55,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:21:55,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:21:55,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:21:55,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:21:55,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:21:55,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:21:55,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:21:55,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:21:55,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:21:55,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:21:55,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:21:55,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:21:55,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:21:55,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:21:55,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:21:55,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:21:55,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:21:55,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:21:55,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:21:55,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:21:55,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:21:55,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:21:55,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:21:55,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:21:55,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:21:55,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:21:55,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:21:55,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:21:55,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:21:55,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:21:55,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:21:55,058 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:21:55,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:21:55,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:21:55,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:21:55,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:21:55,093 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:21:55,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:21:55,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:21:55,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:21:55,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:21:55,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:21:55,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:21:55,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:21:55,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:21:55,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:21:55,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:21:55,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:21:55,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:21:55,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:21:55,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:21:55,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:21:55,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:21:55,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:21:55,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:21:55,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:21:55,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:21:55,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:21:55,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:21:55,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:21:55,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:21:55,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:21:55,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:21:55,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:21:55,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:21:55,450 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:21:55,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2022-12-06 04:21:56,507 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:21:56,801 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:21:56,802 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2022-12-06 04:21:56,830 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08e7a26f/ce8af48479094bc7ba53cae55d946358/FLAG564398c9b [2022-12-06 04:21:56,848 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08e7a26f/ce8af48479094bc7ba53cae55d946358 [2022-12-06 04:21:56,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:21:56,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:21:56,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:21:56,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:21:56,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:21:56,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:21:56" (1/1) ... [2022-12-06 04:21:56,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d78d692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:56, skipping insertion in model container [2022-12-06 04:21:56,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:21:56" (1/1) ... [2022-12-06 04:21:56,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:21:56,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:21:57,080 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/rfi002_tso.i[987,1000] [2022-12-06 04:21:57,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:21:57,331 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:21:57,345 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/rfi002_tso.i[987,1000] [2022-12-06 04:21:57,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:57,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:57,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:21:57,483 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:21:57,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57 WrapperNode [2022-12-06 04:21:57,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:21:57,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:21:57,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:21:57,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:21:57,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,569 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 203 [2022-12-06 04:21:57,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:21:57,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:21:57,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:21:57,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:21:57,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,624 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:21:57,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:21:57,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:21:57,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:21:57,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (1/1) ... [2022-12-06 04:21:57,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:21:57,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:21:57,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:21:57,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:21:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:21:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:21:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:21:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:21:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:21:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:21:57,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:21:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:21:57,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:21:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:21:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:21:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:21:57,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:21:57,720 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:21:57,847 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:21:57,849 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:21:58,280 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:21:58,544 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:21:58,544 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:21:58,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:21:58 BoogieIcfgContainer [2022-12-06 04:21:58,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:21:58,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:21:58,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:21:58,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:21:58,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:21:56" (1/3) ... [2022-12-06 04:21:58,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f7cc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:21:58, skipping insertion in model container [2022-12-06 04:21:58,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:57" (2/3) ... [2022-12-06 04:21:58,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f7cc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:21:58, skipping insertion in model container [2022-12-06 04:21:58,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:21:58" (3/3) ... [2022-12-06 04:21:58,555 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2022-12-06 04:21:58,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:21:58,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 04:21:58,573 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:21:58,632 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:21:58,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-12-06 04:21:58,731 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:21:58,732 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:21:58,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 04:21:58,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 107 transitions, 224 flow [2022-12-06 04:21:58,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 216 flow [2022-12-06 04:21:58,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:58,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 216 flow [2022-12-06 04:21:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 216 flow [2022-12-06 04:21:58,817 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:21:58,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:21:58,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 04:21:58,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 216 flow [2022-12-06 04:21:58,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 1314 [2022-12-06 04:22:05,719 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-06 04:22:05,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:22:05,746 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;@485550d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:22:05,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:22:05,750 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 04:22:05,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:05,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:05,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:22:05,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 581242839, now seen corresponding path program 1 times [2022-12-06 04:22:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009208625] [2022-12-06 04:22:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:06,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:06,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009208625] [2022-12-06 04:22:06,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009208625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:06,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:06,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:22:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775501513] [2022-12-06 04:22:06,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:06,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:22:06,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:22:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:22:06,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:22:06,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:06,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:06,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:22:06,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:06,415 INFO L130 PetriNetUnfolder]: 455/756 cut-off events. [2022-12-06 04:22:06,416 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:22:06,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 756 events. 455/756 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3157 event pairs, 35 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 1520. Up to 673 conditions per place. [2022-12-06 04:22:06,422 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 04:22:06,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 130 flow [2022-12-06 04:22:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:22:06,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:22:06,433 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:22:06,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 130 flow [2022-12-06 04:22:06,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:06,437 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2022-12-06 04:22:06,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2022-12-06 04:22:06,441 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 04:22:06,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:06,442 INFO L89 Accepts]: Start accepts. Operand has 28 places, 21 transitions, 50 flow [2022-12-06 04:22:06,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:06,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:06,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 21 transitions, 50 flow [2022-12-06 04:22:06,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 21 transitions, 50 flow [2022-12-06 04:22:06,451 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:22:06,451 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:06,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:22:06,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 21 transitions, 50 flow [2022-12-06 04:22:06,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:22:06,612 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:06,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 04:22:06,615 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2022-12-06 04:22:06,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:06,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:06,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:22:06,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:22:06,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash 838659334, now seen corresponding path program 1 times [2022-12-06 04:22:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:06,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822750919] [2022-12-06 04:22:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:06,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-06 04:22:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:06,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822750919] [2022-12-06 04:22:06,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822750919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:06,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:06,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:22:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871055762] [2022-12-06 04:22:06,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:06,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:22:06,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:22:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:22:06,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:22:06,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:06,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:06,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:22:06,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:06,923 INFO L130 PetriNetUnfolder]: 395/660 cut-off events. [2022-12-06 04:22:06,924 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 04:22:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 660 events. 395/660 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2567 event pairs, 95 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 1364. Up to 481 conditions per place. [2022-12-06 04:22:06,928 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 24 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-06 04:22:06,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 128 flow [2022-12-06 04:22:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:22:06,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-06 04:22:06,929 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:22:06,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 128 flow [2022-12-06 04:22:06,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:06,931 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2022-12-06 04:22:06,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-06 04:22:06,932 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 04:22:06,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:06,932 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 44 flow [2022-12-06 04:22:06,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:06,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:06,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 44 flow [2022-12-06 04:22:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 44 flow [2022-12-06 04:22:06,938 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:22:06,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:06,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:22:06,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 44 flow [2022-12-06 04:22:06,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:22:07,167 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:07,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 04:22:07,170 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2022-12-06 04:22:07,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:07,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:07,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:07,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:22:07,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:07,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash 228671409, now seen corresponding path program 1 times [2022-12-06 04:22:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:07,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045298982] [2022-12-06 04:22:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:07,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045298982] [2022-12-06 04:22:07,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045298982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:07,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:07,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:22:07,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963372811] [2022-12-06 04:22:07,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:07,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:22:07,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:22:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:22:07,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:22:07,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:07,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:07,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:22:07,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:07,533 INFO L130 PetriNetUnfolder]: 214/374 cut-off events. [2022-12-06 04:22:07,533 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:22:07,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 374 events. 214/374 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1347 event pairs, 94 based on Foata normal form. 21/395 useless extension candidates. Maximal degree in co-relation 777. Up to 225 conditions per place. [2022-12-06 04:22:07,539 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:22:07,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 124 flow [2022-12-06 04:22:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 04:22:07,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-06 04:22:07,542 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 3 states and 29 transitions. [2022-12-06 04:22:07,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 124 flow [2022-12-06 04:22:07,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:07,544 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 48 flow [2022-12-06 04:22:07,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-06 04:22:07,545 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2022-12-06 04:22:07,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:07,545 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 48 flow [2022-12-06 04:22:07,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:07,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:07,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 48 flow [2022-12-06 04:22:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 48 flow [2022-12-06 04:22:07,553 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:22:07,553 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:07,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:22:07,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 48 flow [2022-12-06 04:22:07,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:22:07,596 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:07,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:22:07,598 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 48 flow [2022-12-06 04:22:07,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:07,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:07,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:07,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:22:07,599 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:07,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1948856575, now seen corresponding path program 1 times [2022-12-06 04:22:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:07,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35406615] [2022-12-06 04:22:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:08,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:08,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35406615] [2022-12-06 04:22:08,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35406615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:08,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:08,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:22:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422125351] [2022-12-06 04:22:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:08,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:22:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:22:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:22:08,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:22:08,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 48 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:08,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:08,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:22:08,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:08,304 INFO L130 PetriNetUnfolder]: 199/350 cut-off events. [2022-12-06 04:22:08,304 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 04:22:08,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 350 events. 199/350 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1139 event pairs, 83 based on Foata normal form. 9/359 useless extension candidates. Maximal degree in co-relation 766. Up to 210 conditions per place. [2022-12-06 04:22:08,307 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 04:22:08,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 115 flow [2022-12-06 04:22:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 04:22:08,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-06 04:22:08,308 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states and 26 transitions. [2022-12-06 04:22:08,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 115 flow [2022-12-06 04:22:08,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:08,309 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 52 flow [2022-12-06 04:22:08,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-06 04:22:08,310 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 04:22:08,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:08,311 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 52 flow [2022-12-06 04:22:08,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:08,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:08,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 52 flow [2022-12-06 04:22:08,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 52 flow [2022-12-06 04:22:08,317 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:22:08,317 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:22:08,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:22:08,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 52 flow [2022-12-06 04:22:08,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 04:22:08,318 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:08,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:22:08,319 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 52 flow [2022-12-06 04:22:08,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:08,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:08,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:08,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:22:08,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1884650672, now seen corresponding path program 1 times [2022-12-06 04:22:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:08,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134658703] [2022-12-06 04:22:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:09,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:09,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134658703] [2022-12-06 04:22:09,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134658703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:09,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:09,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:22:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702397165] [2022-12-06 04:22:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:09,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:22:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:22:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:22:09,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:22:09,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 52 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:09,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:09,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:22:09,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:09,688 INFO L130 PetriNetUnfolder]: 268/478 cut-off events. [2022-12-06 04:22:09,688 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 04:22:09,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 478 events. 268/478 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1880 event pairs, 11 based on Foata normal form. 6/484 useless extension candidates. Maximal degree in co-relation 1094. Up to 293 conditions per place. [2022-12-06 04:22:09,691 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 37 selfloop transitions, 19 changer transitions 0/56 dead transitions. [2022-12-06 04:22:09,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 56 transitions, 252 flow [2022-12-06 04:22:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:22:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:22:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-06 04:22:09,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-06 04:22:09,694 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 52 flow. Second operand 7 states and 58 transitions. [2022-12-06 04:22:09,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 56 transitions, 252 flow [2022-12-06 04:22:09,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 56 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:09,696 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 167 flow [2022-12-06 04:22:09,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2022-12-06 04:22:09,697 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 04:22:09,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:09,697 INFO L89 Accepts]: Start accepts. Operand has 33 places, 37 transitions, 167 flow [2022-12-06 04:22:09,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:09,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:09,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 37 transitions, 167 flow [2022-12-06 04:22:09,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 37 transitions, 167 flow [2022-12-06 04:22:09,722 INFO L130 PetriNetUnfolder]: 38/127 cut-off events. [2022-12-06 04:22:09,722 INFO L131 PetriNetUnfolder]: For 54/59 co-relation queries the response was YES. [2022-12-06 04:22:09,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 127 events. 38/127 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 578 event pairs, 3 based on Foata normal form. 3/125 useless extension candidates. Maximal degree in co-relation 278. Up to 40 conditions per place. [2022-12-06 04:22:09,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 37 transitions, 167 flow [2022-12-06 04:22:09,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-06 04:22:09,766 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:09,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 04:22:09,768 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 167 flow [2022-12-06 04:22:09,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:09,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:09,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:09,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:22:09,770 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:09,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:09,770 INFO L85 PathProgramCache]: Analyzing trace with hash 901105394, now seen corresponding path program 2 times [2022-12-06 04:22:09,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:09,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793778139] [2022-12-06 04:22:09,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:09,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:11,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793778139] [2022-12-06 04:22:11,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793778139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:11,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:11,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 04:22:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691300562] [2022-12-06 04:22:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:11,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 04:22:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:11,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 04:22:11,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 04:22:11,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:22:11,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 167 flow. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:11,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:11,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:22:11,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:11,414 INFO L130 PetriNetUnfolder]: 228/405 cut-off events. [2022-12-06 04:22:11,414 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-06 04:22:11,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 405 events. 228/405 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1484 event pairs, 82 based on Foata normal form. 8/413 useless extension candidates. Maximal degree in co-relation 1217. Up to 205 conditions per place. [2022-12-06 04:22:11,417 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 37 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2022-12-06 04:22:11,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 309 flow [2022-12-06 04:22:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:22:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:22:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-06 04:22:11,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2022-12-06 04:22:11,419 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 167 flow. Second operand 6 states and 41 transitions. [2022-12-06 04:22:11,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 309 flow [2022-12-06 04:22:11,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 309 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:22:11,422 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 223 flow [2022-12-06 04:22:11,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2022-12-06 04:22:11,423 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 04:22:11,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:11,423 INFO L89 Accepts]: Start accepts. Operand has 41 places, 38 transitions, 223 flow [2022-12-06 04:22:11,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:11,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:11,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 38 transitions, 223 flow [2022-12-06 04:22:11,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 223 flow [2022-12-06 04:22:11,447 INFO L130 PetriNetUnfolder]: 38/128 cut-off events. [2022-12-06 04:22:11,447 INFO L131 PetriNetUnfolder]: For 106/108 co-relation queries the response was YES. [2022-12-06 04:22:11,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 128 events. 38/128 cut-off events. For 106/108 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 566 event pairs, 4 based on Foata normal form. 2/127 useless extension candidates. Maximal degree in co-relation 349. Up to 44 conditions per place. [2022-12-06 04:22:11,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 223 flow [2022-12-06 04:22:11,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:22:11,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [528] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 04:22:11,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [528] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 04:22:12,074 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:22:12,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 652 [2022-12-06 04:22:12,075 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 219 flow [2022-12-06 04:22:12,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:12,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:12,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:12,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:22:12,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1884319877, now seen corresponding path program 1 times [2022-12-06 04:22:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:12,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066223272] [2022-12-06 04:22:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:12,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066223272] [2022-12-06 04:22:12,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066223272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:12,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:12,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:22:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781030777] [2022-12-06 04:22:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:12,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:22:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:22:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:22:12,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:22:12,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 219 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:12,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:12,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:22:12,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:13,099 INFO L130 PetriNetUnfolder]: 283/498 cut-off events. [2022-12-06 04:22:13,099 INFO L131 PetriNetUnfolder]: For 706/706 co-relation queries the response was YES. [2022-12-06 04:22:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 498 events. 283/498 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2001 event pairs, 22 based on Foata normal form. 6/504 useless extension candidates. Maximal degree in co-relation 1758. Up to 282 conditions per place. [2022-12-06 04:22:13,103 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 36 selfloop transitions, 33 changer transitions 0/69 dead transitions. [2022-12-06 04:22:13,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 516 flow [2022-12-06 04:22:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:22:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:22:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-12-06 04:22:13,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 04:22:13,105 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 219 flow. Second operand 8 states and 64 transitions. [2022-12-06 04:22:13,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 516 flow [2022-12-06 04:22:13,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 488 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:13,110 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 424 flow [2022-12-06 04:22:13,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=48, PETRI_TRANSITIONS=55} [2022-12-06 04:22:13,110 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-06 04:22:13,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:13,111 INFO L89 Accepts]: Start accepts. Operand has 48 places, 55 transitions, 424 flow [2022-12-06 04:22:13,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:13,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:13,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 55 transitions, 424 flow [2022-12-06 04:22:13,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 55 transitions, 424 flow [2022-12-06 04:22:13,170 INFO L130 PetriNetUnfolder]: 74/186 cut-off events. [2022-12-06 04:22:13,170 INFO L131 PetriNetUnfolder]: For 371/393 co-relation queries the response was YES. [2022-12-06 04:22:13,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 186 events. 74/186 cut-off events. For 371/393 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 868 event pairs, 5 based on Foata normal form. 12/190 useless extension candidates. Maximal degree in co-relation 656. Up to 87 conditions per place. [2022-12-06 04:22:13,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 55 transitions, 424 flow [2022-12-06 04:22:13,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 04:22:13,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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-06 04:22:13,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [539] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:22:13,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 04:22:14,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-06 04:22:14,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [469] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_84 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_74 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_107 (ite .cse1 v_~x$w_buff1~0_104 v_~x~0_164)) v_~x~0_163) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_203) v_~x$w_buff1_used~0_202) (= v_~x$r_buff0_thd1~0_83 (ite .cse2 0 v_~x$r_buff0_thd1~0_84)) (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= v_~x$r_buff1_thd1~0_73 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_83 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_202 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_74))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_84, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_74, ~x~0=v_~x~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x~0=v_~x~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207} 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-06 04:22:15,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:15,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1934 [2022-12-06 04:22:15,045 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 442 flow [2022-12-06 04:22:15,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:15,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:15,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:15,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:22:15,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1976993349, now seen corresponding path program 2 times [2022-12-06 04:22:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:15,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941706063] [2022-12-06 04:22:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:15,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:15,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941706063] [2022-12-06 04:22:15,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941706063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:15,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:15,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:22:15,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449528292] [2022-12-06 04:22:15,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:15,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:22:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:15,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:22:15,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:22:15,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:22:15,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 442 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:15,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:15,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:22:15,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:16,422 INFO L130 PetriNetUnfolder]: 470/827 cut-off events. [2022-12-06 04:22:16,422 INFO L131 PetriNetUnfolder]: For 1921/1921 co-relation queries the response was YES. [2022-12-06 04:22:16,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 827 events. 470/827 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3842 event pairs, 83 based on Foata normal form. 9/836 useless extension candidates. Maximal degree in co-relation 3514. Up to 325 conditions per place. [2022-12-06 04:22:16,429 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 62 selfloop transitions, 33 changer transitions 25/120 dead transitions. [2022-12-06 04:22:16,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 120 transitions, 1126 flow [2022-12-06 04:22:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:22:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:22:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-06 04:22:16,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3894230769230769 [2022-12-06 04:22:16,431 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 442 flow. Second operand 8 states and 81 transitions. [2022-12-06 04:22:16,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 120 transitions, 1126 flow [2022-12-06 04:22:16,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 120 transitions, 1050 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:16,442 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 598 flow [2022-12-06 04:22:16,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2022-12-06 04:22:16,444 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-06 04:22:16,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:16,445 INFO L89 Accepts]: Start accepts. Operand has 56 places, 63 transitions, 598 flow [2022-12-06 04:22:16,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:16,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:16,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 63 transitions, 598 flow [2022-12-06 04:22:16,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 63 transitions, 598 flow [2022-12-06 04:22:16,495 INFO L130 PetriNetUnfolder]: 98/228 cut-off events. [2022-12-06 04:22:16,495 INFO L131 PetriNetUnfolder]: For 716/729 co-relation queries the response was YES. [2022-12-06 04:22:16,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 228 events. 98/228 cut-off events. For 716/729 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1041 event pairs, 12 based on Foata normal form. 5/222 useless extension candidates. Maximal degree in co-relation 990. Up to 132 conditions per place. [2022-12-06 04:22:16,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 63 transitions, 598 flow [2022-12-06 04:22:16,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:22:16,575 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:16,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 04:22:16,577 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 63 transitions, 598 flow [2022-12-06 04:22:16,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:16,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:16,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:16,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:22:16,578 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:16,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash 564875148, now seen corresponding path program 1 times [2022-12-06 04:22:16,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:16,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203321948] [2022-12-06 04:22:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203321948] [2022-12-06 04:22:17,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203321948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:17,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:17,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:22:17,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449776387] [2022-12-06 04:22:17,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:17,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:22:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:22:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:22:17,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:22:17,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 598 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:17,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:17,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:22:17,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:17,515 INFO L130 PetriNetUnfolder]: 352/645 cut-off events. [2022-12-06 04:22:17,516 INFO L131 PetriNetUnfolder]: For 2413/2413 co-relation queries the response was YES. [2022-12-06 04:22:17,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 645 events. 352/645 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2915 event pairs, 146 based on Foata normal form. 11/656 useless extension candidates. Maximal degree in co-relation 3087. Up to 483 conditions per place. [2022-12-06 04:22:17,521 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 57 selfloop transitions, 7 changer transitions 26/90 dead transitions. [2022-12-06 04:22:17,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 960 flow [2022-12-06 04:22:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:22:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:22:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 04:22:17,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32571428571428573 [2022-12-06 04:22:17,525 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 598 flow. Second operand 7 states and 57 transitions. [2022-12-06 04:22:17,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 960 flow [2022-12-06 04:22:17,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 951 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:22:17,535 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 595 flow [2022-12-06 04:22:17,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2022-12-06 04:22:17,536 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2022-12-06 04:22:17,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:17,536 INFO L89 Accepts]: Start accepts. Operand has 63 places, 59 transitions, 595 flow [2022-12-06 04:22:17,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:17,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:17,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 595 flow [2022-12-06 04:22:17,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 595 flow [2022-12-06 04:22:17,580 INFO L130 PetriNetUnfolder]: 86/200 cut-off events. [2022-12-06 04:22:17,581 INFO L131 PetriNetUnfolder]: For 755/768 co-relation queries the response was YES. [2022-12-06 04:22:17,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 200 events. 86/200 cut-off events. For 755/768 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 874 event pairs, 11 based on Foata normal form. 4/195 useless extension candidates. Maximal degree in co-relation 920. Up to 118 conditions per place. [2022-12-06 04:22:17,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 59 transitions, 595 flow [2022-12-06 04:22:17,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 04:22:17,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] $Ultimate##0-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_826 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_355 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_351 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_793 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_827 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= (ite .cse0 v_~x$w_buff0~0_537 (ite .cse1 v_~x$w_buff1~0_516 1)) v_~x~0_751) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_793) v_~x$w_buff1_used~0_792) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= v_~x$r_buff1_thd1~0_350 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_792 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_354 256) 0)))) 0 v_~x$r_buff1_thd1~0_351)) (= v_~x$w_buff0_used~0_826 (ite .cse0 0 v_~x$w_buff0_used~0_827)) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_355) v_~x$r_buff0_thd1~0_354)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_537, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_355, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_516, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_793, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_351, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_537, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_516, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_792, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_350, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~x~0=v_~x~0_751, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd1~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] and [528] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 04:22:18,716 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:22:18,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1181 [2022-12-06 04:22:18,717 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 595 flow [2022-12-06 04:22:18,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:18,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:18,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:18,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:22:18,718 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1897120808, now seen corresponding path program 1 times [2022-12-06 04:22:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:18,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577568410] [2022-12-06 04:22:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:19,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-06 04:22:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:19,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577568410] [2022-12-06 04:22:19,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577568410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:19,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:19,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:22:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703917748] [2022-12-06 04:22:19,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:19,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:22:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:19,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:22:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:22:19,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:22:19,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 595 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:19,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:19,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:22:19,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:19,429 INFO L130 PetriNetUnfolder]: 323/601 cut-off events. [2022-12-06 04:22:19,429 INFO L131 PetriNetUnfolder]: For 2769/2769 co-relation queries the response was YES. [2022-12-06 04:22:19,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 601 events. 323/601 cut-off events. For 2769/2769 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2705 event pairs, 68 based on Foata normal form. 18/619 useless extension candidates. Maximal degree in co-relation 2980. Up to 344 conditions per place. [2022-12-06 04:22:19,434 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 48 selfloop transitions, 9 changer transitions 19/76 dead transitions. [2022-12-06 04:22:19,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 875 flow [2022-12-06 04:22:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:22:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:22:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 04:22:19,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2022-12-06 04:22:19,435 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 595 flow. Second operand 5 states and 44 transitions. [2022-12-06 04:22:19,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 875 flow [2022-12-06 04:22:19,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 809 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 04:22:19,451 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 518 flow [2022-12-06 04:22:19,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=518, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-06 04:22:19,453 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-06 04:22:19,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:19,453 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 518 flow [2022-12-06 04:22:19,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:19,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:19,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 518 flow [2022-12-06 04:22:19,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 518 flow [2022-12-06 04:22:19,485 INFO L130 PetriNetUnfolder]: 51/140 cut-off events. [2022-12-06 04:22:19,485 INFO L131 PetriNetUnfolder]: For 530/542 co-relation queries the response was YES. [2022-12-06 04:22:19,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 140 events. 51/140 cut-off events. For 530/542 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 560 event pairs, 4 based on Foata normal form. 4/140 useless extension candidates. Maximal degree in co-relation 634. Up to 74 conditions per place. [2022-12-06 04:22:19,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 518 flow [2022-12-06 04:22:19,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:22:20,876 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:22:20,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1424 [2022-12-06 04:22:20,877 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 524 flow [2022-12-06 04:22:20,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:20,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:20,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:20,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:22:20,878 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 04:22:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1016809242, now seen corresponding path program 1 times [2022-12-06 04:22:20,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:20,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213803171] [2022-12-06 04:22:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:21,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213803171] [2022-12-06 04:22:21,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213803171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:21,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:21,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:22:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302210420] [2022-12-06 04:22:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:21,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:22:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:22:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:22:21,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:22:21,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 524 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:21,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:21,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:22:21,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:21,823 INFO L130 PetriNetUnfolder]: 185/349 cut-off events. [2022-12-06 04:22:21,823 INFO L131 PetriNetUnfolder]: For 1442/1442 co-relation queries the response was YES. [2022-12-06 04:22:21,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1761 conditions, 349 events. 185/349 cut-off events. For 1442/1442 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1331 event pairs, 102 based on Foata normal form. 6/354 useless extension candidates. Maximal degree in co-relation 1732. Up to 340 conditions per place. [2022-12-06 04:22:21,827 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 49 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2022-12-06 04:22:21,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 610 flow [2022-12-06 04:22:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:22:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:22:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 04:22:21,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 04:22:21,829 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 524 flow. Second operand 4 states and 28 transitions. [2022-12-06 04:22:21,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 610 flow [2022-12-06 04:22:21,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 582 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 04:22:21,835 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 465 flow [2022-12-06 04:22:21,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=465, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-06 04:22:21,836 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2022-12-06 04:22:21,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:21,836 INFO L89 Accepts]: Start accepts. Operand has 55 places, 51 transitions, 465 flow [2022-12-06 04:22:21,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:21,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:21,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 465 flow [2022-12-06 04:22:21,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 465 flow [2022-12-06 04:22:21,878 INFO L130 PetriNetUnfolder]: 47/127 cut-off events. [2022-12-06 04:22:21,879 INFO L131 PetriNetUnfolder]: For 397/399 co-relation queries the response was YES. [2022-12-06 04:22:21,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 127 events. 47/127 cut-off events. For 397/399 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 489 event pairs, 5 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 557. Up to 68 conditions per place. [2022-12-06 04:22:21,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 465 flow [2022-12-06 04:22:21,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 04:22:21,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] $Ultimate##0-->L804: Formula: (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_82| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_830 256) 0)) (not (= (mod v_~x$w_buff1_used~0_796 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_82|) (= v_~x$w_buff0_used~0_831 v_~x$w_buff1_used~0_796) (= v_~x~0_755 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_82| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_82|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_42| |v_P1Thread1of1ForFork0_~arg#1.offset_42|) (= v_~x$r_buff0_thd0~0_419 v_~x$r_buff1_thd0~0_412) (= |v_P1Thread1of1ForFork0_~arg#1.base_42| |v_P1Thread1of1ForFork0_#in~arg#1.base_42|) (= v_~x$r_buff0_thd1~0_358 v_~x$r_buff1_thd1~0_354) (= v_~x$w_buff0_used~0_830 1) (= v_~x$w_buff0~0_540 v_~x$w_buff1~0_518) (= v_~x$r_buff0_thd2~0_260 1) (= v_~x$r_buff0_thd2~0_261 v_~x$r_buff1_thd2~0_212) (= v_P0Thread1of1ForFork1_~arg.offset_31 |v_P0Thread1of1ForFork1_#in~arg.offset_31|) (= |v_P0Thread1of1ForFork1_#in~arg.base_31| v_P0Thread1of1ForFork1_~arg.base_31) (= 2 v_~x$w_buff0~0_539)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_540, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_358, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_261, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_831} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_539, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_82|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_358, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_42|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_42|, ~x$w_buff1~0=v_~x$w_buff1~0_518, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_796, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_354, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_82|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_412, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_830, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_31, ~x~0=v_~x~0_755} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] and [469] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_84 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_74 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_107 (ite .cse1 v_~x$w_buff1~0_104 v_~x~0_164)) v_~x~0_163) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_203) v_~x$w_buff1_used~0_202) (= v_~x$r_buff0_thd1~0_83 (ite .cse2 0 v_~x$r_buff0_thd1~0_84)) (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= v_~x$r_buff1_thd1~0_73 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_83 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_202 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_74))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_84, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_74, ~x~0=v_~x~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x~0=v_~x~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207} 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-06 04:22:22,830 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:22:22,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] $Ultimate##0-->L763: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_1002 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_431 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_1004 256) 0))) (let ((.cse2 (and .cse0 (not .cse4))) (.cse3 (and .cse1 .cse0))) (and (= v_~x$r_buff0_thd2~0_300 1) (= v_~x$w_buff0_used~0_1002 (ite .cse0 0 1)) (= v_~x$r_buff0_thd0~0_541 v_~x$r_buff1_thd0~0_524) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_110| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_110|) (= v_~x$r_buff1_thd1~0_428 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_958 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_430 256) 0)))) 0 v_~x$r_buff0_thd1~0_431)) (= (ite .cse0 v_~x$w_buff0~0_647 (ite .cse2 v_~x$w_buff1~0_622 1)) v_~x~0_920) (= 2 v_~x$w_buff0~0_647) (= v_~x$w_buff0~0_648 v_~x$w_buff1~0_622) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_110| 0)) (= v_P0Thread1of1ForFork1_~arg.offset_37 |v_P0Thread1of1ForFork1_#in~arg.offset_37|) (= |v_P0Thread1of1ForFork1_#in~arg.base_37| v_P0Thread1of1ForFork1_~arg.base_37) (= (ite .cse3 0 v_~x$r_buff0_thd1~0_431) v_~x$r_buff0_thd1~0_430) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_110|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_46| |v_P1Thread1of1ForFork0_~arg#1.offset_46|) (= v_~x$r_buff0_thd2~0_301 v_~x$r_buff1_thd2~0_236) (= |v_P1Thread1of1ForFork0_~arg#1.base_46| |v_P1Thread1of1ForFork0_#in~arg#1.base_46|) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff0_used~0_1004) v_~x$w_buff1_used~0_958)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_648, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_541, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_431, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_37|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_37|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_301, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1004} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_647, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_541, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_110|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_430, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_46|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_46|, ~x$w_buff1~0=v_~x$w_buff1~0_622, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_958, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_236, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_110|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_37|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_300, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_524, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1002, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_37|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_37, ~x~0=v_~x~0_920} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] and [481] L831-->L847: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd2~0_76 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd2~0_81 256) 0))) (let ((.cse9 (not .cse8)) (.cse10 (and .cse8 (= (mod v_~x$w_buff1_used~0_213 256) 0))) (.cse7 (and .cse8 .cse2)) (.cse11 (= (mod v_~x$w_buff0_used~0_220 256) 0))) (let ((.cse5 (or .cse10 .cse7 .cse11)) (.cse6 (and (not .cse11) .cse9)) (.cse3 (= (mod v_~x$w_buff1_used~0_212 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_118 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_219 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_60 v_~__unbuffered_p1_EBX~0_18) v_~x~0_171) (= v_~x$w_buff1~0_113 v_~x$w_buff1~0_112) (= v_~x$mem_tmp~0_60 v_~x~0_173) (= v_~weak$$choice2~0_118 |v_P1Thread1of1ForFork0_#t~nondet8#1_1|) (= v_~x$flush_delayed~0_83 0) (= v_~x$r_buff1_thd2~0_75 (ite .cse0 v_~x$r_buff1_thd2~0_76 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_80 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~x$r_buff1_thd2~0_76 0))) (= |v_P1Thread1of1ForFork0_#t~nondet7#1_1| v_~weak$$choice0~0_28) (= (ite .cse0 v_~x$w_buff0_used~0_220 (ite .cse5 v_~x$w_buff0_used~0_220 (ite .cse6 0 v_~x$w_buff0_used~0_220))) v_~x$w_buff0_used~0_219) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse5 v_~x~0_173 (ite .cse6 v_~x$w_buff0~0_118 v_~x$w_buff1~0_113))) (= (ite .cse0 v_~x$r_buff0_thd2~0_81 (ite (or .cse7 .cse4 (and .cse3 .cse8)) v_~x$r_buff0_thd2~0_81 (ite (and (not .cse4) .cse9) 0 v_~x$r_buff0_thd2~0_81))) v_~x$r_buff0_thd2~0_80) (= v_~x$w_buff0~0_118 v_~x$w_buff0~0_117) (= v_~x$w_buff1_used~0_212 (ite .cse0 v_~x$w_buff1_used~0_213 (ite (or .cse10 .cse7 .cse4) v_~x$w_buff1_used~0_213 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_118, ~x$w_buff1~0=v_~x$w_buff1~0_113, P1Thread1of1ForFork0_#t~nondet7#1=|v_P1Thread1of1ForFork0_#t~nondet7#1_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_213, P1Thread1of1ForFork0_#t~nondet8#1=|v_P1Thread1of1ForFork0_#t~nondet8#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_81, ~x~0=v_~x~0_173, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_220} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_117, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~x$flush_delayed~0=v_~x$flush_delayed~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_219, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_118, ~x~0=v_~x~0_171} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~nondet8#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork0_#t~nondet7#1, ~weak$$choice2~0, ~x~0] [2022-12-06 04:22:23,159 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:22:23,160 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:22:23,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:22:23,160 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 04:22:23,165 INFO L158 Benchmark]: Toolchain (without parser) took 26312.79ms. Allocated memory was 184.5MB in the beginning and 508.6MB in the end (delta: 324.0MB). Free memory was 146.3MB in the beginning and 317.2MB in the end (delta: -170.8MB). Peak memory consumption was 154.3MB. Max. memory is 8.0GB. [2022-12-06 04:22:23,165 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:22:23,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.42ms. Allocated memory is still 184.5MB. Free memory was 146.3MB in the beginning and 116.0MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 04:22:23,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.37ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:23,166 INFO L158 Benchmark]: Boogie Preprocessor took 58.65ms. Allocated memory is still 184.5MB. Free memory was 112.3MB in the beginning and 109.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:23,166 INFO L158 Benchmark]: RCFGBuilder took 917.37ms. Allocated memory is still 184.5MB. Free memory was 109.7MB in the beginning and 142.8MB in the end (delta: -33.1MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. [2022-12-06 04:22:23,166 INFO L158 Benchmark]: TraceAbstraction took 24614.51ms. Allocated memory was 184.5MB in the beginning and 508.6MB in the end (delta: 324.0MB). Free memory was 142.3MB in the beginning and 317.2MB in the end (delta: -174.9MB). Peak memory consumption was 149.6MB. Max. memory is 8.0GB. [2022-12-06 04:22:23,167 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.14ms. Allocated memory is still 184.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 631.42ms. Allocated memory is still 184.5MB. Free memory was 146.3MB in the beginning and 116.0MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.37ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.65ms. Allocated memory is still 184.5MB. Free memory was 112.3MB in the beginning and 109.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 917.37ms. Allocated memory is still 184.5MB. Free memory was 109.7MB in the beginning and 142.8MB in the end (delta: -33.1MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. * TraceAbstraction took 24614.51ms. Allocated memory was 184.5MB in the beginning and 508.6MB in the end (delta: 324.0MB). Free memory was 142.3MB in the beginning and 317.2MB in the end (delta: -174.9MB). Peak memory consumption was 149.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 110 PlacesBefore, 30 PlacesAfterwards, 105 TransitionsBefore, 24 TransitionsAfterwards, 1314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 50 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1017, independent: 958, independent conditional: 958, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1017, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1017, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1017, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 891, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 891, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 506, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 484, dependent conditional: 0, dependent unconditional: 484, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1017, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 891, unknown conditional: 0, unknown unconditional: 891] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1135, Positive conditional cache size: 0, Positive unconditional cache size: 1135, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 28 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 55, independent conditional: 2, independent unconditional: 53, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 55, independent conditional: 2, independent unconditional: 53, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 55, independent conditional: 2, independent unconditional: 53, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, independent: 53, independent conditional: 2, independent unconditional: 51, dependent: 23, dependent conditional: 7, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 7, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 157, dependent conditional: 37, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 76, unknown conditional: 9, unknown unconditional: 67] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, 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.2s, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 24, independent conditional: 24, 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: 46, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 222, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 221, dependent conditional: 13, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 26, unknown conditional: 2, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 61, Positive conditional cache size: 2, Positive unconditional cache size: 59, Negative cache size: 41, Negative conditional cache size: 9, Negative unconditional cache size: 32, 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, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 38, 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: 58, independent: 38, independent conditional: 6, independent unconditional: 32, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 58, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 67, Positive conditional cache size: 2, Positive unconditional cache size: 65, Negative cache size: 46, Negative conditional cache size: 9, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 41, independent conditional: 41, 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: 60, independent: 41, independent conditional: 2, independent unconditional: 39, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 41, independent conditional: 0, independent unconditional: 41, 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: 60, independent: 41, independent conditional: 0, independent unconditional: 41, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 69, Positive conditional cache size: 2, Positive unconditional cache size: 67, Negative cache size: 46, Negative conditional cache size: 9, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 82, independent conditional: 52, independent unconditional: 30, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 82, independent conditional: 36, independent unconditional: 46, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 82, independent conditional: 36, independent unconditional: 46, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 79, independent conditional: 35, independent unconditional: 44, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 72, Positive conditional cache size: 3, Positive unconditional cache size: 69, Negative cache size: 50, Negative conditional cache size: 13, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 41 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 104, independent conditional: 104, 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: 132, independent: 104, independent conditional: 52, independent unconditional: 52, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 44, dependent conditional: 30, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 94, independent conditional: 30, independent unconditional: 64, dependent: 25, dependent conditional: 14, dependent unconditional: 11, unknown: 13, unknown conditional: 4, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 91, Positive conditional cache size: 5, Positive unconditional cache size: 86, Negative cache size: 53, Negative conditional cache size: 15, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 48 PlacesBefore, 47 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 169, independent conditional: 95, independent unconditional: 74, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 169, independent conditional: 75, independent unconditional: 94, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 169, independent conditional: 75, independent unconditional: 94, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 5, independent unconditional: 1, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 163, independent conditional: 70, independent unconditional: 93, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 104, Positive conditional cache size: 10, Positive unconditional cache size: 94, Negative cache size: 54, Negative conditional cache size: 15, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 82, independent unconditional: 33, dependent: 32, dependent conditional: 20, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, independent: 115, independent conditional: 67, independent unconditional: 48, dependent: 42, dependent conditional: 30, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 115, independent conditional: 67, independent unconditional: 48, dependent: 42, dependent conditional: 30, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 113, independent conditional: 66, independent unconditional: 47, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 106, Positive conditional cache size: 11, Positive unconditional cache size: 95, Negative cache size: 60, Negative conditional cache size: 21, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 60 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 186, independent conditional: 186, 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: 244, independent: 186, independent conditional: 150, independent unconditional: 36, dependent: 58, dependent conditional: 34, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 186, independent conditional: 102, independent unconditional: 84, dependent: 74, dependent conditional: 50, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 186, independent conditional: 102, independent unconditional: 84, dependent: 74, dependent conditional: 50, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 182, independent conditional: 100, independent unconditional: 82, dependent: 72, dependent conditional: 48, dependent unconditional: 24, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 122, Positive conditional cache size: 13, Positive unconditional cache size: 109, Negative cache size: 62, Negative conditional cache size: 23, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 211, independent: 161, independent conditional: 75, independent unconditional: 86, dependent: 50, dependent conditional: 30, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 271, independent: 161, independent conditional: 40, independent unconditional: 121, dependent: 110, dependent conditional: 90, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 271, independent: 161, independent conditional: 40, independent unconditional: 121, dependent: 110, dependent conditional: 90, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 271, independent: 158, independent conditional: 40, independent unconditional: 118, dependent: 104, dependent conditional: 84, dependent unconditional: 20, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 129, Positive conditional cache size: 13, Positive unconditional cache size: 116, Negative cache size: 68, Negative conditional cache size: 29, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 55 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 140, independent: 95, independent conditional: 50, independent unconditional: 45, dependent: 45, dependent conditional: 27, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 95, independent conditional: 22, independent unconditional: 73, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 95, independent conditional: 22, independent unconditional: 73, dependent: 72, dependent conditional: 54, dependent unconditional: 18, 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: 167, independent: 95, independent conditional: 22, independent unconditional: 73, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 131, Positive conditional cache size: 13, Positive unconditional cache size: 118, Negative cache size: 68, Negative conditional cache size: 29, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 1 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:22:23,208 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...