/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_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:30:22,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:30:22,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:30:22,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:30:22,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:30:22,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:30:22,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:30:22,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:30:22,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:30:22,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:30:22,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:30:22,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:30:22,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:30:22,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:30:22,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:30:22,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:30:22,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:30:22,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:30:22,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:30:22,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:30:22,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:30:22,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:30:22,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:30:22,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:30:22,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:30:22,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:30:22,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:30:22,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:30:22,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:30:22,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:30:22,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:30:22,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:30:22,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:30:22,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:30:22,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:30:22,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:30:22,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:30:22,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:30:22,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:30:22,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:30:22,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:30:22,427 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-13 09:30:22,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:30:22,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:30:22,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:30:22,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:30:22,465 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:30:22,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:30:22,465 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:30:22,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:30:22,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:30:22,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:30:22,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:30:22,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:30:22,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:30:22,466 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:30:22,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:30:22,467 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:30:22,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:30:22,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:30:22,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:30:22,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:30:22,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:30:22,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:22,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:30:22,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:30:22,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:30:22,468 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:30:22,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:30:22,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:30:22,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:30:22,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:30:22,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:30:22,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:30:22,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:30:22,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:30:22,795 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:30:22,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:30:23,971 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:30:24,258 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:30:24,259 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:30:24,273 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2050a35ad/b00f6f73458f493eb4667446fd714ca4/FLAGc345eac29 [2022-12-13 09:30:24,284 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2050a35ad/b00f6f73458f493eb4667446fd714ca4 [2022-12-13 09:30:24,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:30:24,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:30:24,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:24,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:30:24,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:30:24,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea5462f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24, skipping insertion in model container [2022-12-13 09:30:24,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:30:24,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:30:24,472 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_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 09:30:24,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:24,711 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:30:24,722 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_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 09:30:24,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:24,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:24,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:24,823 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:30:24,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24 WrapperNode [2022-12-13 09:30:24,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:24,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:24,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:30:24,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:30:24,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,897 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 09:30:24,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:24,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:30:24,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:30:24,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:30:24,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,938 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:30:24,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:30:24,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:30:24,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:30:24,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:24,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:30:25,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:30:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:30:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:30:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:30:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:30:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:30:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:30:25,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:30:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:30:25,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:30:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:30:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:30:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:30:25,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:30:25,056 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:30:25,198 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:30:25,199 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:30:25,607 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:30:25,773 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:30:25,773 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:30:25,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:25 BoogieIcfgContainer [2022-12-13 09:30:25,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:30:25,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:30:25,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:30:25,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:30:25,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:30:24" (1/3) ... [2022-12-13 09:30:25,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c45437c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:25, skipping insertion in model container [2022-12-13 09:30:25,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24" (2/3) ... [2022-12-13 09:30:25,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c45437c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:25, skipping insertion in model container [2022-12-13 09:30:25,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:25" (3/3) ... [2022-12-13 09:30:25,783 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:30:25,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:30:25,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:30:25,799 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:30:25,844 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:30:25,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 09:30:25,935 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 09:30:25,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:25,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 09:30:25,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 09:30:25,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-13 09:30:25,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:25,963 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 09:30:25,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-13 09:30:25,987 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 09:30:25,989 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:25,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 09:30:25,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 09:30:25,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-13 09:30:33,111 INFO L241 LiptonReduction]: Total number of compositions: 72 [2022-12-13 09:30:33,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:30:33,131 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;@60b01a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:33,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:30:33,136 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 09:30:33,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:33,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:33,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:30:33,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash 475983688, now seen corresponding path program 1 times [2022-12-13 09:30:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:33,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906198062] [2022-12-13 09:30:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:33,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:33,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906198062] [2022-12-13 09:30:33,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906198062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:33,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:33,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:33,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673495288] [2022-12-13 09:30:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:33,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:33,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:33,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:33,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 49 [2022-12-13 09:30:33,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:33,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:33,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 49 [2022-12-13 09:30:33,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:34,285 INFO L130 PetriNetUnfolder]: 1980/3524 cut-off events. [2022-12-13 09:30:34,286 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 09:30:34,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6715 conditions, 3524 events. 1980/3524 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 23607 event pairs, 150 based on Foata normal form. 0/2038 useless extension candidates. Maximal degree in co-relation 6705. Up to 2839 conditions per place. [2022-12-13 09:30:34,302 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 25 selfloop transitions, 3 changer transitions 40/74 dead transitions. [2022-12-13 09:30:34,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 290 flow [2022-12-13 09:30:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-13 09:30:34,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2022-12-13 09:30:34,314 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 104 flow. Second operand 3 states and 93 transitions. [2022-12-13 09:30:34,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 290 flow [2022-12-13 09:30:34,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:34,320 INFO L231 Difference]: Finished difference. Result has 52 places, 25 transitions, 60 flow [2022-12-13 09:30:34,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2022-12-13 09:30:34,325 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 09:30:34,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:34,326 INFO L89 Accepts]: Start accepts. Operand has 52 places, 25 transitions, 60 flow [2022-12-13 09:30:34,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:34,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:34,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 25 transitions, 60 flow [2022-12-13 09:30:34,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 60 flow [2022-12-13 09:30:34,339 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 09:30:34,339 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:34,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 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-13 09:30:34,342 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 60 flow [2022-12-13 09:30:34,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 09:30:34,489 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:34,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-13 09:30:34,491 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 60 flow [2022-12-13 09:30:34,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:34,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:34,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:34,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:30:34,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2141146691, now seen corresponding path program 1 times [2022-12-13 09:30:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:34,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724899958] [2022-12-13 09:30:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:35,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724899958] [2022-12-13 09:30:35,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724899958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:35,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:35,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341035004] [2022-12-13 09:30:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:35,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:35,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:35,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:35,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 09:30:35,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:35,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:35,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 09:30:35,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:35,295 INFO L130 PetriNetUnfolder]: 300/555 cut-off events. [2022-12-13 09:30:35,295 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 09:30:35,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 555 events. 300/555 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2416 event pairs, 116 based on Foata normal form. 24/495 useless extension candidates. Maximal degree in co-relation 1130. Up to 345 conditions per place. [2022-12-13 09:30:35,299 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 29 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-13 09:30:35,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 150 flow [2022-12-13 09:30:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 09:30:35,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-13 09:30:35,300 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 60 flow. Second operand 3 states and 47 transitions. [2022-12-13 09:30:35,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 150 flow [2022-12-13 09:30:35,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:35,302 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 62 flow [2022-12-13 09:30:35,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 09:30:35,303 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -22 predicate places. [2022-12-13 09:30:35,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:35,303 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 09:30:35,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:35,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:35,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 09:30:35,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 09:30:35,308 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 09:30:35,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:35,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:30:35,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 09:30:35,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 09:30:35,365 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:35,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 09:30:35,366 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 62 flow [2022-12-13 09:30:35,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:35,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:35,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:35,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:30:35,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1414611549, now seen corresponding path program 1 times [2022-12-13 09:30:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:35,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237968805] [2022-12-13 09:30:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:35,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237968805] [2022-12-13 09:30:35,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237968805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:35,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:35,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221749452] [2022-12-13 09:30:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:35,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:35,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:35,825 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 09:30:35,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:35,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:35,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 09:30:35,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:35,969 INFO L130 PetriNetUnfolder]: 279/519 cut-off events. [2022-12-13 09:30:35,969 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 09:30:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 519 events. 279/519 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2171 event pairs, 104 based on Foata normal form. 12/454 useless extension candidates. Maximal degree in co-relation 1083. Up to 317 conditions per place. [2022-12-13 09:30:35,973 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 25 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2022-12-13 09:30:35,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 137 flow [2022-12-13 09:30:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 09:30:35,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 09:30:35,975 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 62 flow. Second operand 3 states and 44 transitions. [2022-12-13 09:30:35,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 137 flow [2022-12-13 09:30:35,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:35,976 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 64 flow [2022-12-13 09:30:35,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-13 09:30:35,977 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -21 predicate places. [2022-12-13 09:30:35,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:35,977 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 64 flow [2022-12-13 09:30:35,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:35,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:35,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 64 flow [2022-12-13 09:30:35,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 64 flow [2022-12-13 09:30:35,984 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:30:35,984 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:30:35,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:30:35,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 64 flow [2022-12-13 09:30:35,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 09:30:36,172 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:36,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-13 09:30:36,173 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 62 flow [2022-12-13 09:30:36,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:36,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:36,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:36,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:30:36,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -860182947, now seen corresponding path program 1 times [2022-12-13 09:30:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:36,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517497535] [2022-12-13 09:30:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:36,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:36,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517497535] [2022-12-13 09:30:36,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517497535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:36,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:36,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104008402] [2022-12-13 09:30:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:36,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:36,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:36,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:30:36,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:36,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:36,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:30:36,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:37,144 INFO L130 PetriNetUnfolder]: 259/487 cut-off events. [2022-12-13 09:30:37,144 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 09:30:37,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 487 events. 259/487 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2101 event pairs, 61 based on Foata normal form. 5/436 useless extension candidates. Maximal degree in co-relation 1052. Up to 312 conditions per place. [2022-12-13 09:30:37,147 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 31 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2022-12-13 09:30:37,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 197 flow [2022-12-13 09:30:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-13 09:30:37,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2022-12-13 09:30:37,148 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 62 flow. Second operand 6 states and 72 transitions. [2022-12-13 09:30:37,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 197 flow [2022-12-13 09:30:37,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:37,150 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 125 flow [2022-12-13 09:30:37,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 09:30:37,151 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -18 predicate places. [2022-12-13 09:30:37,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:37,151 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 125 flow [2022-12-13 09:30:37,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:37,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:37,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 125 flow [2022-12-13 09:30:37,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 125 flow [2022-12-13 09:30:37,163 INFO L130 PetriNetUnfolder]: 22/85 cut-off events. [2022-12-13 09:30:37,164 INFO L131 PetriNetUnfolder]: For 28/32 co-relation queries the response was YES. [2022-12-13 09:30:37,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 85 events. 22/85 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 350 event pairs, 3 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 176. Up to 42 conditions per place. [2022-12-13 09:30:37,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 125 flow [2022-12-13 09:30:37,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 09:30:37,178 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:37,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 09:30:37,179 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 125 flow [2022-12-13 09:30:37,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:37,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:37,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:37,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:30:37,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -903283797, now seen corresponding path program 2 times [2022-12-13 09:30:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:37,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821402225] [2022-12-13 09:30:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:37,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:37,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821402225] [2022-12-13 09:30:37,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821402225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:37,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:37,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:37,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339280732] [2022-12-13 09:30:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:37,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:37,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:30:37,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:37,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:37,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:30:37,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:38,128 INFO L130 PetriNetUnfolder]: 261/483 cut-off events. [2022-12-13 09:30:38,128 INFO L131 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2022-12-13 09:30:38,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 483 events. 261/483 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2024 event pairs, 27 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 1329. Up to 384 conditions per place. [2022-12-13 09:30:38,131 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 36 selfloop transitions, 13 changer transitions 0/54 dead transitions. [2022-12-13 09:30:38,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 297 flow [2022-12-13 09:30:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 09:30:38,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2022-12-13 09:30:38,134 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 125 flow. Second operand 6 states and 73 transitions. [2022-12-13 09:30:38,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 297 flow [2022-12-13 09:30:38,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:30:38,139 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 208 flow [2022-12-13 09:30:38,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-13 09:30:38,141 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2022-12-13 09:30:38,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:38,142 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 208 flow [2022-12-13 09:30:38,143 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:38,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:38,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 39 transitions, 208 flow [2022-12-13 09:30:38,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 208 flow [2022-12-13 09:30:38,160 INFO L130 PetriNetUnfolder]: 38/124 cut-off events. [2022-12-13 09:30:38,161 INFO L131 PetriNetUnfolder]: For 115/119 co-relation queries the response was YES. [2022-12-13 09:30:38,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 124 events. 38/124 cut-off events. For 115/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 546 event pairs, 4 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 326. Up to 59 conditions per place. [2022-12-13 09:30:38,162 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 208 flow [2022-12-13 09:30:38,162 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 09:30:38,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} 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, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:30:38,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} 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, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [482] $Ultimate##0-->L796: Formula: (and (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_97) (= v_~x$r_buff0_thd2~0_244 1) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_334) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_570 256) 0)) (not (= (mod v_~x$w_buff0_used~0_633 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= v_~x$w_buff0_used~0_634 v_~x$w_buff1_used~0_570) (= v_~x$r_buff0_thd2~0_245 v_~x$r_buff1_thd2~0_193) (= v_~y~0_47 1) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_394) (= v_~x$w_buff0_used~0_633 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_49| |v_P1Thread1of1ForFork1_~arg#1.base_49|) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd1~0_220 v_~x$r_buff1_thd1~0_228) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_49| |v_P1Thread1of1ForFork1_~arg#1.offset_49|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_634, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_49|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_49|, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_193, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_570, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_228, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_334, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 09:30:39,153 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:39,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1012 [2022-12-13 09:30:39,155 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 214 flow [2022-12-13 09:30:39,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:39,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:39,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:39,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:30:39,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2140835234, now seen corresponding path program 1 times [2022-12-13 09:30:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:39,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629880411] [2022-12-13 09:30:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:39,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629880411] [2022-12-13 09:30:39,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629880411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:39,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:39,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:30:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168649845] [2022-12-13 09:30:39,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:39,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 09:30:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 09:30:39,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 09:30:39,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-13 09:30:39,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:39,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:39,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-13 09:30:39,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:40,173 INFO L130 PetriNetUnfolder]: 342/594 cut-off events. [2022-12-13 09:30:40,173 INFO L131 PetriNetUnfolder]: For 733/733 co-relation queries the response was YES. [2022-12-13 09:30:40,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 594 events. 342/594 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2530 event pairs, 41 based on Foata normal form. 8/472 useless extension candidates. Maximal degree in co-relation 1853. Up to 510 conditions per place. [2022-12-13 09:30:40,178 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 35 selfloop transitions, 19 changer transitions 1/57 dead transitions. [2022-12-13 09:30:40,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 387 flow [2022-12-13 09:30:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:30:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:30:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 09:30:40,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 09:30:40,182 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 214 flow. Second operand 7 states and 70 transitions. [2022-12-13 09:30:40,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 387 flow [2022-12-13 09:30:40,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 372 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 09:30:40,187 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 318 flow [2022-12-13 09:30:40,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-13 09:30:40,190 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2022-12-13 09:30:40,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:40,190 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 318 flow [2022-12-13 09:30:40,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:40,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:40,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 318 flow [2022-12-13 09:30:40,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 318 flow [2022-12-13 09:30:40,217 INFO L130 PetriNetUnfolder]: 42/180 cut-off events. [2022-12-13 09:30:40,218 INFO L131 PetriNetUnfolder]: For 319/332 co-relation queries the response was YES. [2022-12-13 09:30:40,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 180 events. 42/180 cut-off events. For 319/332 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1038 event pairs, 11 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 536. Up to 71 conditions per place. [2022-12-13 09:30:40,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 318 flow [2022-12-13 09:30:40,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-13 09:30:40,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [482] $Ultimate##0-->L796: Formula: (and (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_97) (= v_~x$r_buff0_thd2~0_244 1) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_334) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_570 256) 0)) (not (= (mod v_~x$w_buff0_used~0_633 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= v_~x$w_buff0_used~0_634 v_~x$w_buff1_used~0_570) (= v_~x$r_buff0_thd2~0_245 v_~x$r_buff1_thd2~0_193) (= v_~y~0_47 1) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_394) (= v_~x$w_buff0_used~0_633 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_49| |v_P1Thread1of1ForFork1_~arg#1.base_49|) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd1~0_220 v_~x$r_buff1_thd1~0_228) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_49| |v_P1Thread1of1ForFork1_~arg#1.offset_49|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_634, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_49|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_49|, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_193, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_570, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_228, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_334, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 09:30:40,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L749-->L772: Formula: (let ((.cse17 (= (mod v_~x$r_buff1_thd1~0_256 256) 0)) (.cse19 (= (mod v_~x$r_buff0_thd1~0_248 256) 0))) (let ((.cse21 (not .cse19)) (.cse22 (and .cse19 (= (mod v_~x$w_buff1_used~0_630 256) 0))) (.cse20 (and .cse19 .cse17)) (.cse23 (= (mod v_~x$w_buff0_used~0_695 256) 0))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_210 256) 0))) (.cse13 (or .cse22 .cse20 .cse23)) (.cse14 (and (not .cse23) .cse21))) (let ((.cse6 (ite .cse2 v_~x$w_buff0_used~0_695 (ite .cse13 v_~x$w_buff0_used~0_695 (ite .cse14 0 v_~x$w_buff0_used~0_695))))) (let ((.cse18 (= 0 (mod .cse6 256)))) (let ((.cse10 (ite .cse2 v_~x$w_buff1_used~0_630 (ite (or .cse22 .cse20 .cse18) v_~x$w_buff1_used~0_630 0)))) (let ((.cse11 (= (mod .cse10 256) 0)) (.cse15 (not .cse18))) (let ((.cse5 (ite .cse2 v_~x$r_buff0_thd1~0_248 (ite (or (and .cse11 .cse19) .cse20 .cse18) v_~x$r_buff0_thd1~0_248 (ite (and .cse15 .cse21) 0 v_~x$r_buff0_thd1~0_248))))) (let ((.cse16 (= (mod .cse5 256) 0))) (let ((.cse9 (ite .cse2 v_~x$r_buff1_thd1~0_256 (ite (or (and .cse16 .cse17) .cse18 (and .cse11 .cse16)) v_~x$r_buff1_thd1~0_256 0)))) (let ((.cse8 (not (= (mod .cse9 256) 0))) (.cse7 (not (= (mod v_~x$w_buff0_used~0_693 256) 0))) (.cse12 (not .cse16))) (let ((.cse0 (and .cse12 .cse15)) (.cse3 (ite .cse13 v_~x~0_602 (ite .cse14 v_~x$w_buff0~0_458 v_~x$w_buff1~0_425))) (.cse4 (and .cse12 .cse7)) (.cse1 (and (not .cse11) .cse8))) (and (= (ite .cse0 v_~x$w_buff0~0_457 (ite .cse1 v_~x$w_buff1~0_424 (ite .cse2 v_~x$mem_tmp~0_174 .cse3))) v_~x~0_600) (= v_~x~0_602 v_~x$mem_tmp~0_174) (= |v_P0Thread1of1ForFork0_#t~nondet3_40| v_~weak$$choice0~0_139) (= |v_P0Thread1of1ForFork0_#t~nondet4_40| v_~weak$$choice2~0_210) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd1~0_246 (ite .cse4 0 .cse5)) (= (ite .cse0 0 .cse6) v_~x$w_buff0_used~0_693) (= v_~x$w_buff0~0_458 v_~x$w_buff0~0_457) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_246 256) 0)) .cse7) (and (not (= (mod v_~x$w_buff1_used~0_628 256) 0)) .cse8)) 0 .cse9) v_~x$r_buff1_thd1~0_254) (= v_~__unbuffered_p0_EAX~0_118 .cse3) (= v_~x$w_buff1_used~0_628 (ite (or .cse4 .cse1) 0 .cse10)) (= v_~x$flush_delayed~0_203 0)))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_248, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_630, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_256, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_40|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_40|, ~x~0=v_~x~0_602, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_695} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_457, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_246, ~x$flush_delayed~0=v_~x$flush_delayed~0_203, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_628, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_254, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_693, ~weak$$choice0~0=v_~weak$$choice0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_210, ~x~0=v_~x~0_600} 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, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [482] $Ultimate##0-->L796: Formula: (and (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_97) (= v_~x$r_buff0_thd2~0_244 1) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_334) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_570 256) 0)) (not (= (mod v_~x$w_buff0_used~0_633 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= v_~x$w_buff0_used~0_634 v_~x$w_buff1_used~0_570) (= v_~x$r_buff0_thd2~0_245 v_~x$r_buff1_thd2~0_193) (= v_~y~0_47 1) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_394) (= v_~x$w_buff0_used~0_633 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_49| |v_P1Thread1of1ForFork1_~arg#1.base_49|) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd1~0_220 v_~x$r_buff1_thd1~0_228) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_49| |v_P1Thread1of1ForFork1_~arg#1.offset_49|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_634, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_49|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_49|, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_193, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_570, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_228, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_334, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 09:30:40,873 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:30:40,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 684 [2022-12-13 09:30:40,874 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 321 flow [2022-12-13 09:30:40,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:40,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:40,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:40,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:30:40,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash -488813673, now seen corresponding path program 1 times [2022-12-13 09:30:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:40,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555625828] [2022-12-13 09:30:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:41,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555625828] [2022-12-13 09:30:41,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555625828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:41,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:41,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:30:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896795884] [2022-12-13 09:30:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:30:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:41,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:30:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:30:41,973 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 09:30:41,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 321 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:41,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:41,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 09:30:41,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:42,215 INFO L130 PetriNetUnfolder]: 272/513 cut-off events. [2022-12-13 09:30:42,215 INFO L131 PetriNetUnfolder]: For 1293/1308 co-relation queries the response was YES. [2022-12-13 09:30:42,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 513 events. 272/513 cut-off events. For 1293/1308 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2394 event pairs, 70 based on Foata normal form. 3/450 useless extension candidates. Maximal degree in co-relation 1976. Up to 403 conditions per place. [2022-12-13 09:30:42,219 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 39 selfloop transitions, 15 changer transitions 0/59 dead transitions. [2022-12-13 09:30:42,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 499 flow [2022-12-13 09:30:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:30:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:30:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-13 09:30:42,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4065934065934066 [2022-12-13 09:30:42,220 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 321 flow. Second operand 7 states and 74 transitions. [2022-12-13 09:30:42,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 499 flow [2022-12-13 09:30:42,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 474 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 09:30:42,225 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 340 flow [2022-12-13 09:30:42,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 09:30:42,226 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 09:30:42,226 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:42,226 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 340 flow [2022-12-13 09:30:42,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:42,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:42,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 340 flow [2022-12-13 09:30:42,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 340 flow [2022-12-13 09:30:42,250 INFO L130 PetriNetUnfolder]: 45/175 cut-off events. [2022-12-13 09:30:42,250 INFO L131 PetriNetUnfolder]: For 379/392 co-relation queries the response was YES. [2022-12-13 09:30:42,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 175 events. 45/175 cut-off events. For 379/392 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 992 event pairs, 17 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 543. Up to 67 conditions per place. [2022-12-13 09:30:42,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 340 flow [2022-12-13 09:30:42,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 09:30:42,267 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:42,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 09:30:42,268 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 340 flow [2022-12-13 09:30:42,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:42,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:42,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:42,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:30:42,269 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash -488813394, now seen corresponding path program 1 times [2022-12-13 09:30:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:42,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876289143] [2022-12-13 09:30:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:42,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:42,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876289143] [2022-12-13 09:30:42,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876289143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:42,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:42,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492272274] [2022-12-13 09:30:42,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:42,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:42,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 09:30:42,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:42,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:42,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 09:30:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:43,074 INFO L130 PetriNetUnfolder]: 294/554 cut-off events. [2022-12-13 09:30:43,074 INFO L131 PetriNetUnfolder]: For 1391/1409 co-relation queries the response was YES. [2022-12-13 09:30:43,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 554 events. 294/554 cut-off events. For 1391/1409 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2684 event pairs, 29 based on Foata normal form. 5/489 useless extension candidates. Maximal degree in co-relation 2135. Up to 402 conditions per place. [2022-12-13 09:30:43,078 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 38 selfloop transitions, 21 changer transitions 0/64 dead transitions. [2022-12-13 09:30:43,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 555 flow [2022-12-13 09:30:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:30:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:30:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-13 09:30:43,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2022-12-13 09:30:43,081 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 340 flow. Second operand 7 states and 80 transitions. [2022-12-13 09:30:43,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 555 flow [2022-12-13 09:30:43,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 522 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 09:30:43,085 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 399 flow [2022-12-13 09:30:43,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=399, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2022-12-13 09:30:43,087 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2022-12-13 09:30:43,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:43,087 INFO L89 Accepts]: Start accepts. Operand has 54 places, 50 transitions, 399 flow [2022-12-13 09:30:43,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:43,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:43,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 50 transitions, 399 flow [2022-12-13 09:30:43,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 50 transitions, 399 flow [2022-12-13 09:30:43,112 INFO L130 PetriNetUnfolder]: 54/187 cut-off events. [2022-12-13 09:30:43,112 INFO L131 PetriNetUnfolder]: For 404/424 co-relation queries the response was YES. [2022-12-13 09:30:43,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 187 events. 54/187 cut-off events. For 404/424 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1063 event pairs, 16 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 655. Up to 70 conditions per place. [2022-12-13 09:30:43,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 50 transitions, 399 flow [2022-12-13 09:30:43,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 09:30:43,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:43,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 336 [2022-12-13 09:30:43,423 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 400 flow [2022-12-13 09:30:43,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:43,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:43,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:43,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:30:43,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1940754480, now seen corresponding path program 1 times [2022-12-13 09:30:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:43,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155963709] [2022-12-13 09:30:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:43,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:43,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155963709] [2022-12-13 09:30:43,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155963709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:43,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:43,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:30:43,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950831158] [2022-12-13 09:30:43,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:43,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:30:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:43,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:30:43,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:30:43,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 09:30:43,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:43,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:43,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 09:30:43,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:44,325 INFO L130 PetriNetUnfolder]: 327/705 cut-off events. [2022-12-13 09:30:44,326 INFO L131 PetriNetUnfolder]: For 2552/2552 co-relation queries the response was YES. [2022-12-13 09:30:44,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 705 events. 327/705 cut-off events. For 2552/2552 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4090 event pairs, 76 based on Foata normal form. 53/606 useless extension candidates. Maximal degree in co-relation 2863. Up to 291 conditions per place. [2022-12-13 09:30:44,330 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 59 selfloop transitions, 35 changer transitions 16/111 dead transitions. [2022-12-13 09:30:44,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 948 flow [2022-12-13 09:30:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 09:30:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 09:30:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-12-13 09:30:44,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2022-12-13 09:30:44,332 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 400 flow. Second operand 10 states and 111 transitions. [2022-12-13 09:30:44,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 948 flow [2022-12-13 09:30:44,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 890 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 09:30:44,339 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 577 flow [2022-12-13 09:30:44,339 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=577, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2022-12-13 09:30:44,340 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2022-12-13 09:30:44,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:44,340 INFO L89 Accepts]: Start accepts. Operand has 64 places, 69 transitions, 577 flow [2022-12-13 09:30:44,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:44,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:44,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 69 transitions, 577 flow [2022-12-13 09:30:44,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 69 transitions, 577 flow [2022-12-13 09:30:44,381 INFO L130 PetriNetUnfolder]: 81/299 cut-off events. [2022-12-13 09:30:44,381 INFO L131 PetriNetUnfolder]: For 1508/1569 co-relation queries the response was YES. [2022-12-13 09:30:44,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 299 events. 81/299 cut-off events. For 1508/1569 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1988 event pairs, 10 based on Foata normal form. 7/245 useless extension candidates. Maximal degree in co-relation 1388. Up to 90 conditions per place. [2022-12-13 09:30:44,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 69 transitions, 577 flow [2022-12-13 09:30:44,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-13 09:30:44,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] $Ultimate##0-->L796: Formula: (and (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_97) (= v_~x$r_buff0_thd2~0_244 1) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_334) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_570 256) 0)) (not (= (mod v_~x$w_buff0_used~0_633 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= v_~x$w_buff0_used~0_634 v_~x$w_buff1_used~0_570) (= v_~x$r_buff0_thd2~0_245 v_~x$r_buff1_thd2~0_193) (= v_~y~0_47 1) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_394) (= v_~x$w_buff0_used~0_633 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_49| |v_P1Thread1of1ForFork1_~arg#1.base_49|) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd1~0_220 v_~x$r_buff1_thd1~0_228) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_49| |v_P1Thread1of1ForFork1_~arg#1.offset_49|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_634, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_49|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_49|, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_193, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_570, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_228, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_334, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [471] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_332 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_332, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 09:30:44,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L749-->L796: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_253 256) 0))) (let ((.cse6 (not .cse2)) (.cse3 (and (= (mod v_~x$r_buff1_thd1~0_262 256) 0) .cse2)) (.cse5 (and .cse2 (= (mod v_~x$w_buff1_used~0_636 256) 0))) (.cse10 (= (mod v_~x$w_buff0_used~0_701 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_212 256) 0))) (.cse8 (or .cse3 .cse5 .cse10)) (.cse9 (and .cse6 (not .cse10)))) (let ((.cse1 (ite .cse8 v_~x~0_607 (ite .cse9 v_~x$w_buff0~0_463 v_~x$w_buff1~0_430))) (.cse7 (ite .cse0 v_~x$w_buff0_used~0_701 (ite .cse8 v_~x$w_buff0_used~0_701 (ite .cse9 0 v_~x$w_buff0_used~0_701))))) (and (= v_~x$flush_delayed~0_205 0) (= v_~x$w_buff0_used~0_699 1) (= v_~x$r_buff0_thd1~0_252 v_~x$r_buff1_thd1~0_260) (= v_~y~0_49 v_~__unbuffered_p1_EAX~0_99) (= |v_P0Thread1of1ForFork0_#t~nondet3_44| v_~weak$$choice0~0_141) (= (ite .cse0 v_~x$mem_tmp~0_176 .cse1) v_~x~0_606) (= .cse1 v_~__unbuffered_p0_EAX~0_120) (= v_~x$r_buff0_thd1~0_252 (ite .cse0 v_~x$r_buff0_thd1~0_253 (let ((.cse4 (= (mod .cse7 256) 0))) (ite (or (and .cse2 (= (mod (ite .cse0 v_~x$w_buff1_used~0_636 (ite (or .cse3 .cse4 .cse5) v_~x$w_buff1_used~0_636 0)) 256) 0)) .cse3 .cse4) v_~x$r_buff0_thd1~0_253 (ite (and (not .cse4) .cse6) 0 v_~x$r_buff0_thd1~0_253))))) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_51| |v_P1Thread1of1ForFork1_~arg#1.base_51|) (= 2 v_~x$w_buff0~0_461) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= v_~x$w_buff0~0_463 v_~x$w_buff1~0_428) (= |v_P0Thread1of1ForFork0_#t~nondet4_44| v_~weak$$choice2~0_212) (= v_~y~0_49 1) (= v_~x~0_607 v_~x$mem_tmp~0_176) (= v_~x$w_buff1_used~0_634 .cse7) (= v_~x$r_buff0_thd2~0_249 v_~x$r_buff1_thd2~0_195) (= v_~x$r_buff0_thd0~0_385 v_~x$r_buff1_thd0~0_382) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_699 256) 0)) (not (= (mod v_~x$w_buff1_used~0_634 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_51| |v_P1Thread1of1ForFork1_~arg#1.offset_51|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$r_buff0_thd2~0_248 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_463, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_385, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_253, ~x$w_buff1~0=v_~x$w_buff1~0_430, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_636, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_262, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_249, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_701, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_51|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_51|, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_44|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_44|, ~x~0=v_~x~0_607} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_461, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_252, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_51|, ~x$flush_delayed~0=v_~x$flush_delayed~0_205, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_260, ~x$mem_tmp~0=v_~x$mem_tmp~0_176, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_51|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_120, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_99, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y~0=v_~y~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_385, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_51|, ~x$w_buff1~0=v_~x$w_buff1~0_428, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_195, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_634, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_248, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_382, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_699, ~weak$$choice0~0=v_~weak$$choice0~0_141, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~x~0=v_~x~0_606} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0] and [354] L765-->L772: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_40 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_88 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd1~0_43 (ite .cse0 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_39 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0)))) 0 v_~x$r_buff1_thd1~0_40)) (= v_~x$w_buff0_used~0_87 (ite .cse3 0 v_~x$w_buff0_used~0_88)) (= v_~x~0_49 (ite .cse3 v_~x$w_buff0~0_31 (ite .cse4 v_~x$w_buff1~0_32 v_~x~0_50))) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73) v_~x$w_buff1_used~0_72)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:30:45,747 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:30:45,748 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1408 [2022-12-13 09:30:45,748 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 565 flow [2022-12-13 09:30:45,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:45,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:45,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:45,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:30:45,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash -605522086, now seen corresponding path program 1 times [2022-12-13 09:30:45,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:45,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735253804] [2022-12-13 09:30:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:46,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735253804] [2022-12-13 09:30:46,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735253804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:46,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:46,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:46,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857279056] [2022-12-13 09:30:46,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:46,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:46,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:46,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:46,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 09:30:46,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 565 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:46,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:46,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 09:30:46,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:46,736 INFO L130 PetriNetUnfolder]: 288/691 cut-off events. [2022-12-13 09:30:46,736 INFO L131 PetriNetUnfolder]: For 4369/4397 co-relation queries the response was YES. [2022-12-13 09:30:46,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 691 events. 288/691 cut-off events. For 4369/4397 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4466 event pairs, 97 based on Foata normal form. 32/637 useless extension candidates. Maximal degree in co-relation 3590. Up to 325 conditions per place. [2022-12-13 09:30:46,741 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 43 selfloop transitions, 11 changer transitions 40/101 dead transitions. [2022-12-13 09:30:46,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 1024 flow [2022-12-13 09:30:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-13 09:30:46,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3850574712643678 [2022-12-13 09:30:46,743 INFO L175 Difference]: Start difference. First operand has 60 places, 66 transitions, 565 flow. Second operand 6 states and 67 transitions. [2022-12-13 09:30:46,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 1024 flow [2022-12-13 09:30:46,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 921 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-13 09:30:46,754 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 441 flow [2022-12-13 09:30:46,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2022-12-13 09:30:46,754 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2022-12-13 09:30:46,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:46,755 INFO L89 Accepts]: Start accepts. Operand has 62 places, 55 transitions, 441 flow [2022-12-13 09:30:46,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:46,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:46,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 55 transitions, 441 flow [2022-12-13 09:30:46,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 441 flow [2022-12-13 09:30:46,815 INFO L130 PetriNetUnfolder]: 57/225 cut-off events. [2022-12-13 09:30:46,815 INFO L131 PetriNetUnfolder]: For 976/986 co-relation queries the response was YES. [2022-12-13 09:30:46,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 225 events. 57/225 cut-off events. For 976/986 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1435 event pairs, 0 based on Foata normal form. 4/172 useless extension candidates. Maximal degree in co-relation 982. Up to 71 conditions per place. [2022-12-13 09:30:46,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 55 transitions, 441 flow [2022-12-13 09:30:46,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-13 09:30:47,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [482] $Ultimate##0-->L796: Formula: (and (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_97) (= v_~x$r_buff0_thd2~0_244 1) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_334) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_570 256) 0)) (not (= (mod v_~x$w_buff0_used~0_633 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= v_~x$w_buff0_used~0_634 v_~x$w_buff1_used~0_570) (= v_~x$r_buff0_thd2~0_245 v_~x$r_buff1_thd2~0_193) (= v_~y~0_47 1) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_394) (= v_~x$w_buff0_used~0_633 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_49| |v_P1Thread1of1ForFork1_~arg#1.base_49|) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd1~0_220 v_~x$r_buff1_thd1~0_228) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_49| |v_P1Thread1of1ForFork1_~arg#1.offset_49|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_634, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_49|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_49|, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_193, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_570, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_228, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_334, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 09:30:49,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_332 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_332, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [482] $Ultimate##0-->L796: Formula: (and (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_97) (= v_~x$r_buff0_thd2~0_244 1) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_334) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_570 256) 0)) (not (= (mod v_~x$w_buff0_used~0_633 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= v_~x$w_buff0_used~0_634 v_~x$w_buff1_used~0_570) (= v_~x$r_buff0_thd2~0_245 v_~x$r_buff1_thd2~0_193) (= v_~y~0_47 1) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_394) (= v_~x$w_buff0_used~0_633 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_49| |v_P1Thread1of1ForFork1_~arg#1.base_49|) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd1~0_220 v_~x$r_buff1_thd1~0_228) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_49| |v_P1Thread1of1ForFork1_~arg#1.offset_49|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_634, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_49|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_49|, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_193, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_570, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_228, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_334, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 09:30:49,631 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:30:49,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2876 [2022-12-13 09:30:49,631 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 455 flow [2022-12-13 09:30:49,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:49,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:49,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:49,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:30:49,632 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash -569611237, now seen corresponding path program 1 times [2022-12-13 09:30:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:49,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11861769] [2022-12-13 09:30:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:50,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11861769] [2022-12-13 09:30:50,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11861769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:50,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:50,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78690669] [2022-12-13 09:30:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:50,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:50,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:50,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:50,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 09:30:50,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:50,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:50,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 09:30:50,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:50,601 INFO L130 PetriNetUnfolder]: 176/428 cut-off events. [2022-12-13 09:30:50,601 INFO L131 PetriNetUnfolder]: For 2533/2544 co-relation queries the response was YES. [2022-12-13 09:30:50,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2237 conditions, 428 events. 176/428 cut-off events. For 2533/2544 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2384 event pairs, 30 based on Foata normal form. 22/384 useless extension candidates. Maximal degree in co-relation 2210. Up to 249 conditions per place. [2022-12-13 09:30:50,604 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 42 selfloop transitions, 12 changer transitions 17/78 dead transitions. [2022-12-13 09:30:50,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 753 flow [2022-12-13 09:30:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:30:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:30:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 09:30:50,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3380952380952381 [2022-12-13 09:30:50,605 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 455 flow. Second operand 7 states and 71 transitions. [2022-12-13 09:30:50,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 753 flow [2022-12-13 09:30:50,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 697 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-13 09:30:50,612 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 451 flow [2022-12-13 09:30:50,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=451, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2022-12-13 09:30:50,612 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2022-12-13 09:30:50,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:50,612 INFO L89 Accepts]: Start accepts. Operand has 63 places, 55 transitions, 451 flow [2022-12-13 09:30:50,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:50,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:50,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 55 transitions, 451 flow [2022-12-13 09:30:50,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 55 transitions, 451 flow [2022-12-13 09:30:50,645 INFO L130 PetriNetUnfolder]: 59/227 cut-off events. [2022-12-13 09:30:50,645 INFO L131 PetriNetUnfolder]: For 1051/1055 co-relation queries the response was YES. [2022-12-13 09:30:50,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 227 events. 59/227 cut-off events. For 1051/1055 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1365 event pairs, 3 based on Foata normal form. 2/171 useless extension candidates. Maximal degree in co-relation 1012. Up to 68 conditions per place. [2022-12-13 09:30:50,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 55 transitions, 451 flow [2022-12-13 09:30:50,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-13 09:30:50,649 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:50,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 09:30:50,650 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 451 flow [2022-12-13 09:30:50,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:50,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:50,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:50,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:30:50,650 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash -569702377, now seen corresponding path program 2 times [2022-12-13 09:30:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709470131] [2022-12-13 09:30:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:51,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709470131] [2022-12-13 09:30:51,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709470131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:51,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:51,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365268611] [2022-12-13 09:30:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:51,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:51,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:51,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:51,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 09:30:51,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 451 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:51,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:51,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 09:30:51,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:51,775 INFO L130 PetriNetUnfolder]: 118/325 cut-off events. [2022-12-13 09:30:51,775 INFO L131 PetriNetUnfolder]: For 2194/2200 co-relation queries the response was YES. [2022-12-13 09:30:51,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 325 events. 118/325 cut-off events. For 2194/2200 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1784 event pairs, 38 based on Foata normal form. 24/302 useless extension candidates. Maximal degree in co-relation 1705. Up to 240 conditions per place. [2022-12-13 09:30:51,778 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 32 selfloop transitions, 9 changer transitions 14/61 dead transitions. [2022-12-13 09:30:51,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 595 flow [2022-12-13 09:30:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-13 09:30:51,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-13 09:30:51,780 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 451 flow. Second operand 6 states and 57 transitions. [2022-12-13 09:30:51,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 595 flow [2022-12-13 09:30:51,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 553 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-13 09:30:51,785 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 361 flow [2022-12-13 09:30:51,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2022-12-13 09:30:51,785 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2022-12-13 09:30:51,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:51,786 INFO L89 Accepts]: Start accepts. Operand has 62 places, 44 transitions, 361 flow [2022-12-13 09:30:51,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:51,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:51,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 44 transitions, 361 flow [2022-12-13 09:30:51,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 44 transitions, 361 flow [2022-12-13 09:30:51,811 INFO L130 PetriNetUnfolder]: 53/182 cut-off events. [2022-12-13 09:30:51,811 INFO L131 PetriNetUnfolder]: For 769/784 co-relation queries the response was YES. [2022-12-13 09:30:51,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 182 events. 53/182 cut-off events. For 769/784 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 994 event pairs, 6 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 787. Up to 59 conditions per place. [2022-12-13 09:30:51,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 44 transitions, 361 flow [2022-12-13 09:30:51,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 09:30:51,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] $Ultimate##0-->L796: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_43 |v_P0Thread1of1ForFork0_#in~arg.base_43|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_75| |v_P1Thread1of1ForFork1_~arg#1.base_75|) (= v_~x$w_buff0~0_574 v_~x$w_buff1~0_540) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_81| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_831 256) 0)) (not (= (mod v_~x$w_buff1_used~0_761 256) 0)))) 1 0)) (= v_~x$r_buff0_thd2~0_347 v_~x$r_buff1_thd2~0_263) (= v_~x$r_buff0_thd2~0_346 1) (= 2 v_~x$w_buff0~0_573) (= v_P0Thread1of1ForFork0_~arg.offset_43 |v_P0Thread1of1ForFork0_#in~arg.offset_43|) (= v_~y~0_73 1) (= v_~y~0_73 v_~__unbuffered_p1_EAX~0_123) (= v_~x$r_buff0_thd1~0_316 v_~x$r_buff1_thd1~0_326) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_75| |v_P1Thread1of1ForFork1_~arg#1.offset_75|) (= v_~x$w_buff0_used~0_831 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_81| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_81| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_81|) (= v_~x$w_buff0_used~0_832 v_~x$w_buff1_used~0_761) (= v_~x~0_730 1) (= v_~x$r_buff0_thd0~0_453 v_~x$r_buff1_thd0~0_448)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_574, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_75|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_453, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_316, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_43|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_43|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_347, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_832, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_75|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_573, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_453, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_316, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_75|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_75|, ~x$w_buff1~0=v_~x$w_buff1~0_540, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_263, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_761, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_326, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_346, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_448, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_43, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_81|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_831, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_75|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_75|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_123, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_81|, ~y~0=v_~y~0_73, ~x~0=v_~x~0_730, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:30:52,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [499] $Ultimate##0-->L796: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff0_thd1~0_309 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_824 256) 0)) .cse0))) (let ((.cse1 (ite .cse2 0 v_~x$w_buff0_used~0_824))) (and (= v_~x$r_buff0_thd1~0_308 v_~x$r_buff1_thd1~0_318) (= v_P0Thread1of1ForFork0_~arg.base_39 |v_P0Thread1of1ForFork0_#in~arg.base_39|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_71| |v_P1Thread1of1ForFork1_~arg#1.offset_71|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_753 256) 0)) (not (= (mod v_~x$w_buff0_used~0_823 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|) (= v_~y~0_69 1) (= v_~x$r_buff0_thd1~0_308 (ite (and .cse0 (not (= (mod .cse1 256) 0))) 0 v_~x$r_buff0_thd1~0_309)) (= .cse1 v_~x$w_buff1_used~0_753) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_71| |v_P1Thread1of1ForFork1_~arg#1.base_71|) (= v_~x$r_buff0_thd0~0_449 v_~x$r_buff1_thd0~0_444) (= 2 v_~x$w_buff0~0_565) (= v_~x$r_buff0_thd2~0_338 1) (= (ite .cse2 v_~x$w_buff0~0_566 (ite (and (not (= (mod v_~x$w_buff1_used~0_754 256) 0)) (not (= (mod v_~x$r_buff1_thd1~0_319 256) 0))) v_~x$w_buff1~0_533 1)) v_~x~0_722) (= v_~x$w_buff0~0_566 v_~x$w_buff1~0_532) (= v_~x$r_buff0_thd2~0_339 v_~x$r_buff1_thd2~0_259) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_77| 0)) (= v_~y~0_69 v_~__unbuffered_p1_EAX~0_119) (= v_~x$w_buff0_used~0_823 1) (= v_P0Thread1of1ForFork0_~arg.offset_39 |v_P0Thread1of1ForFork0_#in~arg.offset_39|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_77| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_566, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_449, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_309, ~x$w_buff1~0=v_~x$w_buff1~0_533, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_754, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_319, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_339, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_824, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_71|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_71|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_39|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_565, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_449, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_308, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_71|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_71|, ~x$w_buff1~0=v_~x$w_buff1~0_532, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_259, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_753, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_318, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_338, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_444, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_39, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_77|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_823, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_71|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_71|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_722, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_39} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} 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, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 09:30:53,082 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:30:53,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1297 [2022-12-13 09:30:53,084 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 338 flow [2022-12-13 09:30:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:53,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:53,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:53,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:30:53,084 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -458505222, now seen corresponding path program 1 times [2022-12-13 09:30:53,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:53,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513312770] [2022-12-13 09:30:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:53,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:53,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513312770] [2022-12-13 09:30:53,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513312770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:53,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:53,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686090695] [2022-12-13 09:30:53,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:53,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:53,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:53,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-13 09:30:53,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:53,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:53,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-13 09:30:53,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:54,087 INFO L130 PetriNetUnfolder]: 113/263 cut-off events. [2022-12-13 09:30:54,088 INFO L131 PetriNetUnfolder]: For 1543/1549 co-relation queries the response was YES. [2022-12-13 09:30:54,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 263 events. 113/263 cut-off events. For 1543/1549 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1280 event pairs, 6 based on Foata normal form. 6/235 useless extension candidates. Maximal degree in co-relation 1407. Up to 216 conditions per place. [2022-12-13 09:30:54,090 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 34 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2022-12-13 09:30:54,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 501 flow [2022-12-13 09:30:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:30:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:30:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 09:30:54,091 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-13 09:30:54,091 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 338 flow. Second operand 5 states and 48 transitions. [2022-12-13 09:30:54,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 501 flow [2022-12-13 09:30:54,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 397 flow, removed 38 selfloop flow, removed 13 redundant places. [2022-12-13 09:30:54,095 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 297 flow [2022-12-13 09:30:54,095 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-13 09:30:54,095 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2022-12-13 09:30:54,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:54,096 INFO L89 Accepts]: Start accepts. Operand has 48 places, 43 transitions, 297 flow [2022-12-13 09:30:54,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:54,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:54,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 297 flow [2022-12-13 09:30:54,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 297 flow [2022-12-13 09:30:54,122 INFO L130 PetriNetUnfolder]: 56/191 cut-off events. [2022-12-13 09:30:54,122 INFO L131 PetriNetUnfolder]: For 423/435 co-relation queries the response was YES. [2022-12-13 09:30:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 191 events. 56/191 cut-off events. For 423/435 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1093 event pairs, 3 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 701. Up to 63 conditions per place. [2022-12-13 09:30:54,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 297 flow [2022-12-13 09:30:54,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 09:30:54,127 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:54,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 09:30:54,128 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 297 flow [2022-12-13 09:30:54,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:54,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:54,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:54,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:30:54,128 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash -569697975, now seen corresponding path program 1 times [2022-12-13 09:30:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:54,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911222834] [2022-12-13 09:30:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:54,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911222834] [2022-12-13 09:30:54,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911222834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:54,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:54,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494010407] [2022-12-13 09:30:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:54,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-13 09:30:54,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:54,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:54,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-13 09:30:54,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:54,928 INFO L130 PetriNetUnfolder]: 110/271 cut-off events. [2022-12-13 09:30:54,928 INFO L131 PetriNetUnfolder]: For 928/934 co-relation queries the response was YES. [2022-12-13 09:30:54,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 271 events. 110/271 cut-off events. For 928/934 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1343 event pairs, 39 based on Foata normal form. 12/246 useless extension candidates. Maximal degree in co-relation 1241. Up to 215 conditions per place. [2022-12-13 09:30:54,930 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 31 selfloop transitions, 9 changer transitions 8/54 dead transitions. [2022-12-13 09:30:54,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 462 flow [2022-12-13 09:30:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-13 09:30:54,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36231884057971014 [2022-12-13 09:30:54,932 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 297 flow. Second operand 6 states and 50 transitions. [2022-12-13 09:30:54,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 462 flow [2022-12-13 09:30:54,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 448 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:54,935 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 301 flow [2022-12-13 09:30:54,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-12-13 09:30:54,936 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2022-12-13 09:30:54,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:54,936 INFO L89 Accepts]: Start accepts. Operand has 53 places, 42 transitions, 301 flow [2022-12-13 09:30:54,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:54,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:54,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 301 flow [2022-12-13 09:30:54,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 301 flow [2022-12-13 09:30:54,958 INFO L130 PetriNetUnfolder]: 53/166 cut-off events. [2022-12-13 09:30:54,958 INFO L131 PetriNetUnfolder]: For 436/439 co-relation queries the response was YES. [2022-12-13 09:30:54,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 166 events. 53/166 cut-off events. For 436/439 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 865 event pairs, 6 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 646. Up to 57 conditions per place. [2022-12-13 09:30:54,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 301 flow [2022-12-13 09:30:54,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 09:30:54,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] L812-->L819: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_52 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_59 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_192 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_171 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_192) v_~x$w_buff0_used~0_191) (= v_~x$w_buff1_used~0_170 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_171)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_170 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_58 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_52) v_~x$r_buff1_thd2~0_51) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_59) v_~x$r_buff0_thd2~0_58) (= (ite .cse0 v_~x$w_buff0~0_85 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_156)) v_~x~0_155)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} 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, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 09:30:55,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:55,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-13 09:30:55,177 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 305 flow [2022-12-13 09:30:55,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:55,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:55,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:55,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:30:55,177 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1328671281, now seen corresponding path program 1 times [2022-12-13 09:30:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355135787] [2022-12-13 09:30:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:55,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355135787] [2022-12-13 09:30:55,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355135787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:55,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:55,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:55,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934684228] [2022-12-13 09:30:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:55,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:55,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 09:30:55,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:55,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:55,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 09:30:55,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:55,754 INFO L130 PetriNetUnfolder]: 150/343 cut-off events. [2022-12-13 09:30:55,754 INFO L131 PetriNetUnfolder]: For 1333/1350 co-relation queries the response was YES. [2022-12-13 09:30:55,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 343 events. 150/343 cut-off events. For 1333/1350 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1788 event pairs, 27 based on Foata normal form. 22/311 useless extension candidates. Maximal degree in co-relation 1580. Up to 204 conditions per place. [2022-12-13 09:30:55,756 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 32 selfloop transitions, 13 changer transitions 13/64 dead transitions. [2022-12-13 09:30:55,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 556 flow [2022-12-13 09:30:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:30:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:30:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-13 09:30:55,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2022-12-13 09:30:55,758 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 305 flow. Second operand 7 states and 61 transitions. [2022-12-13 09:30:55,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 556 flow [2022-12-13 09:30:55,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 519 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-13 09:30:55,761 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 335 flow [2022-12-13 09:30:55,761 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 09:30:55,762 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 09:30:55,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:55,762 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 335 flow [2022-12-13 09:30:55,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:55,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:55,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 335 flow [2022-12-13 09:30:55,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 335 flow [2022-12-13 09:30:55,785 INFO L130 PetriNetUnfolder]: 49/171 cut-off events. [2022-12-13 09:30:55,785 INFO L131 PetriNetUnfolder]: For 418/427 co-relation queries the response was YES. [2022-12-13 09:30:55,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 171 events. 49/171 cut-off events. For 418/427 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 939 event pairs, 3 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 670. Up to 63 conditions per place. [2022-12-13 09:30:55,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 335 flow [2022-12-13 09:30:55,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 09:30:55,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} 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, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 09:30:56,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [363] L796-->L812: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse10 (not .cse9)) (.cse1 (and .cse9 .cse8)) (.cse2 (and (= (mod v_~x$w_buff1_used~0_181 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_52 v_~__unbuffered_p1_EBX~0_22) v_~x~0_163) (= v_~x$w_buff0~0_96 v_~x$w_buff0~0_95) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_19) (= v_~x$mem_tmp~0_52 v_~x~0_165) (= (ite .cse0 v_~x$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_181 0)) v_~x$w_buff1_used~0_180) (= v_~x$w_buff1~0_97 v_~x$w_buff1~0_96) (= v_~x$w_buff0_used~0_203 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~x$r_buff1_thd2~0_56 0))) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse4 v_~x~0_165 (ite .cse5 v_~x$w_buff0~0_96 v_~x$w_buff1~0_97))) (= v_~x$r_buff0_thd2~0_62 (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or .cse1 .cse3 (and .cse7 .cse9)) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse3) .cse10) 0 v_~x$r_buff0_thd2~0_63)))) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_165, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} 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, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 09:30:57,386 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:30:57,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1625 [2022-12-13 09:30:57,387 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 333 flow [2022-12-13 09:30:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:57,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:57,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:57,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 09:30:57,388 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1159248913, now seen corresponding path program 1 times [2022-12-13 09:30:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:57,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161120265] [2022-12-13 09:30:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:58,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161120265] [2022-12-13 09:30:58,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161120265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:58,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:58,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:30:58,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706780255] [2022-12-13 09:30:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:58,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:30:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:58,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:30:58,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:30:58,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 09:30:58,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:58,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:58,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 09:30:58,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:58,465 INFO L130 PetriNetUnfolder]: 147/344 cut-off events. [2022-12-13 09:30:58,465 INFO L131 PetriNetUnfolder]: For 1162/1174 co-relation queries the response was YES. [2022-12-13 09:30:58,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 344 events. 147/344 cut-off events. For 1162/1174 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 1900 event pairs, 26 based on Foata normal form. 23/312 useless extension candidates. Maximal degree in co-relation 1551. Up to 191 conditions per place. [2022-12-13 09:30:58,468 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 34 selfloop transitions, 10 changer transitions 13/62 dead transitions. [2022-12-13 09:30:58,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 565 flow [2022-12-13 09:30:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:30:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:30:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-13 09:30:58,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 09:30:58,469 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 333 flow. Second operand 5 states and 52 transitions. [2022-12-13 09:30:58,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 565 flow [2022-12-13 09:30:58,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 513 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 09:30:58,473 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 293 flow [2022-12-13 09:30:58,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-13 09:30:58,473 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2022-12-13 09:30:58,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:58,473 INFO L89 Accepts]: Start accepts. Operand has 50 places, 40 transitions, 293 flow [2022-12-13 09:30:58,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:58,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:58,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 293 flow [2022-12-13 09:30:58,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 293 flow [2022-12-13 09:30:58,496 INFO L130 PetriNetUnfolder]: 51/178 cut-off events. [2022-12-13 09:30:58,496 INFO L131 PetriNetUnfolder]: For 387/399 co-relation queries the response was YES. [2022-12-13 09:30:58,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 178 events. 51/178 cut-off events. For 387/399 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1010 event pairs, 6 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 670. Up to 58 conditions per place. [2022-12-13 09:30:58,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 293 flow [2022-12-13 09:30:58,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 09:30:58,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L796-->L765: Formula: (let ((.cse15 (= (mod v_~x$r_buff1_thd2~0_282 256) 0)) (.cse22 (= (mod v_~x$r_buff0_thd2~0_375 256) 0))) (let ((.cse23 (not .cse22)) (.cse21 (and .cse15 .cse22)) (.cse26 (= (mod v_~x$w_buff0_used~0_873 256) 0)) (.cse25 (and (= (mod v_~x$w_buff1_used~0_797 256) 0) .cse22))) (let ((.cse9 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet6#1_86| 256) 0))) (.cse12 (or .cse21 .cse26 .cse25)) (.cse13 (and .cse23 (not .cse26)))) (let ((.cse18 (ite .cse9 v_~x$w_buff0_used~0_873 (ite .cse12 v_~x$w_buff0_used~0_873 (ite .cse13 0 v_~x$w_buff0_used~0_873))))) (let ((.cse14 (= (mod .cse18 256) 0))) (let ((.cse10 (ite .cse9 v_~x$w_buff1_used~0_797 (ite (or .cse21 .cse14 .cse25) v_~x$w_buff1_used~0_797 0)))) (let ((.cse17 (= 0 (mod .cse10 256))) (.cse4 (= (mod v_~x$r_buff1_thd1~0_351 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd1~0_341 256) 0))) (let ((.cse7 (not .cse6)) (.cse24 (not .cse14)) (.cse5 (and .cse4 .cse6)) (.cse11 (and .cse17 .cse6))) (let ((.cse19 (or .cse5 .cse14 .cse11)) (.cse20 (and .cse7 .cse24))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_795 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_871 256) 0)) (.cse8 (ite .cse19 v_~x$mem_tmp~0_226 (ite .cse20 v_~x$w_buff0~0_605 v_~x$w_buff1~0_568))) (.cse0 (not (= (mod v_~weak$$choice2~0_262 256) 0)))) (and (= (ite .cse0 v_~x$r_buff1_thd1~0_351 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_340 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~x$r_buff1_thd1~0_351 0)) v_~x$r_buff1_thd1~0_350) (= v_~x$r_buff0_thd1~0_340 (ite .cse0 v_~x$r_buff0_thd1~0_341 (ite (or .cse5 (and .cse2 .cse6) .cse3) v_~x$r_buff0_thd1~0_341 (ite (and (not .cse3) .cse7) 0 v_~x$r_buff0_thd1~0_341)))) (= .cse8 v_~__unbuffered_p0_EAX~0_158) (= v_~x$w_buff1~0_568 v_~x$w_buff1~0_566) (= (ite .cse9 v_~x~0_764 v_~__unbuffered_p1_EBX~0_143) v_~x$mem_tmp~0_226) (= |v_P0Thread1of1ForFork0_#t~nondet4_96| v_~weak$$choice2~0_262) (= (ite .cse0 .cse10 (ite (or .cse5 .cse11 .cse3) .cse10 0)) v_~x$w_buff1_used~0_795) (= |v_P0Thread1of1ForFork0_#t~nondet3_96| v_~weak$$choice0~0_191) (= v_~__unbuffered_p1_EBX~0_143 (ite .cse12 v_~x~0_764 (ite .cse13 v_~x$w_buff0~0_607 v_~x$w_buff1~0_568))) (= (ite .cse0 v_~x$mem_tmp~0_226 .cse8) v_~x~0_762) (= (ite .cse9 v_~x$r_buff1_thd2~0_282 (ite (let ((.cse16 (= (mod v_~x$r_buff0_thd2~0_374 256) 0))) (or .cse14 (and .cse15 .cse16) (and .cse17 .cse16))) v_~x$r_buff1_thd2~0_282 0)) v_~x$r_buff1_thd2~0_281) (= (ite .cse0 .cse18 (ite .cse19 .cse18 (ite .cse20 0 .cse18))) v_~x$w_buff0_used~0_871) (= (ite .cse9 v_~x$r_buff0_thd2~0_375 (ite (or .cse21 .cse14 (and .cse17 .cse22)) v_~x$r_buff0_thd2~0_375 (ite (and .cse23 .cse24) 0 v_~x$r_buff0_thd2~0_375))) v_~x$r_buff0_thd2~0_374) (= v_~x$w_buff0~0_607 v_~x$w_buff0~0_605) (= v_~x$flush_delayed~0_255 0)))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_607, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_341, ~x$w_buff1~0=v_~x$w_buff1~0_568, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_797, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_282, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_351, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_86|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_375, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_873, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_96|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_96|, ~x~0=v_~x~0_764} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_605, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_340, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_85|, ~x$flush_delayed~0=v_~x$flush_delayed~0_255, ~x$w_buff1~0=v_~x$w_buff1~0_566, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_795, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_281, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_350, ~x$mem_tmp~0=v_~x$mem_tmp~0_226, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_374, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_871, ~weak$$choice0~0=v_~weak$$choice0~0_191, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_262, ~x~0=v_~x~0_762} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [364] L812-->L819: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_52 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_59 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_192 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_171 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_192) v_~x$w_buff0_used~0_191) (= v_~x$w_buff1_used~0_170 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_171)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_170 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_58 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_52) v_~x$r_buff1_thd2~0_51) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_59) v_~x$r_buff0_thd2~0_58) (= (ite .cse0 v_~x$w_buff0~0_85 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_156)) v_~x~0_155)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:30:59,632 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L796-->L772: Formula: (let ((.cse9 (= (mod v_~x$r_buff1_thd2~0_300 256) 0)) (.cse18 (= (mod v_~x$r_buff0_thd2~0_395 256) 0))) (let ((.cse19 (not .cse18)) (.cse17 (and .cse9 .cse18)) (.cse37 (= (mod v_~x$w_buff0_used~0_897 256) 0)) (.cse36 (and (= (mod v_~x$w_buff1_used~0_821 256) 0) .cse18))) (let ((.cse7 (not (= 0 (mod |v_P1Thread1of1ForFork1_#t~nondet6#1_98| 256)))) (.cse14 (or .cse17 .cse37 .cse36)) (.cse15 (and .cse19 (not .cse37)))) (let ((.cse35 (ite .cse7 v_~x$w_buff0_used~0_897 (ite .cse14 v_~x$w_buff0_used~0_897 (ite .cse15 0 v_~x$w_buff0_used~0_897))))) (let ((.cse11 (= (mod .cse35 256) 0))) (let ((.cse33 (ite .cse7 v_~x$w_buff1_used~0_821 (ite (or .cse17 .cse36 .cse11) v_~x$w_buff1_used~0_821 0)))) (let ((.cse10 (= (mod .cse33 256) 0)) (.cse29 (= (mod v_~x$r_buff1_thd1~0_370 256) 0)) (.cse31 (= (mod v_~x$r_buff0_thd1~0_360 256) 0))) (let ((.cse20 (not .cse11)) (.cse32 (not .cse31)) (.cse30 (and .cse29 .cse31)) (.cse34 (and .cse10 .cse31))) (let ((.cse5 (not (= (mod v_~weak$$choice2~0_274 256) 0))) (.cse24 (or .cse30 .cse34 .cse11)) (.cse25 (and .cse20 .cse32))) (let ((.cse21 (ite .cse5 .cse35 (ite .cse24 .cse35 (ite .cse25 0 .cse35))))) (let ((.cse28 (= (mod .cse21 256) 0))) (let ((.cse13 (ite .cse5 .cse33 (ite (or .cse28 .cse30 .cse34) .cse33 0)))) (let ((.cse26 (= (mod .cse13 256) 0)) (.cse22 (not .cse28))) (let ((.cse16 (ite .cse5 v_~x$r_buff0_thd1~0_360 (ite (or .cse28 .cse30 (and .cse31 .cse26)) v_~x$r_buff0_thd1~0_360 (ite (and .cse32 .cse22) 0 v_~x$r_buff0_thd1~0_360))))) (let ((.cse27 (= (mod .cse16 256) 0))) (let ((.cse2 (ite .cse5 v_~x$r_buff1_thd1~0_370 (ite (or .cse28 (and .cse27 .cse26) (and .cse27 .cse29)) v_~x$r_buff1_thd1~0_370 0)))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_895 256) 0))) (.cse23 (not .cse27)) (.cse0 (not (= (mod .cse2 256) 0)))) (let ((.cse4 (and .cse0 (not .cse26))) (.cse6 (ite .cse24 v_~x$mem_tmp~0_238 (ite .cse25 v_~x$w_buff0~0_625 v_~x$w_buff1~0_587))) (.cse12 (and .cse1 .cse23)) (.cse3 (and .cse22 .cse23))) (and (= v_~x$r_buff1_thd1~0_368 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_819 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_358 256) 0)) .cse1)) 0 .cse2)) (= |v_P0Thread1of1ForFork0_#t~nondet4_112| v_~weak$$choice2~0_274) (= (ite .cse3 v_~x$w_buff0~0_625 (ite .cse4 v_~x$w_buff1~0_586 (ite .cse5 v_~x$mem_tmp~0_238 .cse6))) v_~x~0_784) (= (ite .cse7 v_~x~0_786 v_~__unbuffered_p1_EBX~0_149) v_~x$mem_tmp~0_238) (= (ite .cse7 v_~x$r_buff1_thd2~0_300 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd2~0_394 256) 0))) (or (and .cse8 .cse9) (and .cse8 .cse10) .cse11)) v_~x$r_buff1_thd2~0_300 0)) v_~x$r_buff1_thd2~0_299) (= (ite (or .cse4 .cse12) 0 .cse13) v_~x$w_buff1_used~0_819) (= (ite .cse14 v_~x~0_786 (ite .cse15 v_~x$w_buff0~0_626 v_~x$w_buff1~0_587)) v_~__unbuffered_p1_EBX~0_149) (= v_~__unbuffered_p0_EAX~0_166 .cse6) (= v_~x$flush_delayed~0_267 0) (= v_~x$w_buff0~0_626 v_~x$w_buff0~0_625) (= v_~x$r_buff0_thd1~0_358 (ite .cse12 0 .cse16)) (= v_~x$w_buff1~0_587 v_~x$w_buff1~0_586) (= |v_P0Thread1of1ForFork0_#t~nondet3_112| v_~weak$$choice0~0_203) (= v_~x$r_buff0_thd2~0_394 (ite .cse7 v_~x$r_buff0_thd2~0_395 (ite (or .cse17 (and .cse10 .cse18) .cse11) v_~x$r_buff0_thd2~0_395 (ite (and .cse19 .cse20) 0 v_~x$r_buff0_thd2~0_395)))) (= v_~x$w_buff0_used~0_895 (ite .cse3 0 .cse21))))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_626, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_360, ~x$w_buff1~0=v_~x$w_buff1~0_587, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_821, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_300, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_370, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_112|, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_98|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_112|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_395, ~x~0=v_~x~0_786, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_897} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_625, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_358, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_95|, ~x$flush_delayed~0=v_~x$flush_delayed~0_267, ~x$w_buff1~0=v_~x$w_buff1~0_586, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_819, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_299, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_368, ~x$mem_tmp~0=v_~x$mem_tmp~0_238, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_394, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_895, ~weak$$choice0~0=v_~weak$$choice0~0_203, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_166, ~weak$$choice2~0=v_~weak$$choice2~0_274, ~x~0=v_~x~0_784} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [364] L812-->L819: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_52 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_59 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_192 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_171 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_192) v_~x$w_buff0_used~0_191) (= v_~x$w_buff1_used~0_170 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_171)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_170 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_58 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_52) v_~x$r_buff1_thd2~0_51) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_59) v_~x$r_buff0_thd2~0_58) (= (ite .cse0 v_~x$w_buff0~0_85 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_156)) v_~x~0_155)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:31:00,167 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:31:00,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1695 [2022-12-13 09:31:00,168 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 291 flow [2022-12-13 09:31:00,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:00,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:00,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:00,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 09:31:00,169 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash -283410867, now seen corresponding path program 1 times [2022-12-13 09:31:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:00,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390728625] [2022-12-13 09:31:00,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:00,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390728625] [2022-12-13 09:31:00,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390728625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:00,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:00,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:00,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495970026] [2022-12-13 09:31:00,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:00,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:00,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:00,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:00,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-13 09:31:00,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:00,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:00,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-13 09:31:00,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:01,156 INFO L130 PetriNetUnfolder]: 95/240 cut-off events. [2022-12-13 09:31:01,156 INFO L131 PetriNetUnfolder]: For 796/806 co-relation queries the response was YES. [2022-12-13 09:31:01,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 240 events. 95/240 cut-off events. For 796/806 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1216 event pairs, 32 based on Foata normal form. 14/218 useless extension candidates. Maximal degree in co-relation 1128. Up to 188 conditions per place. [2022-12-13 09:31:01,158 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 24 selfloop transitions, 9 changer transitions 9/47 dead transitions. [2022-12-13 09:31:01,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 431 flow [2022-12-13 09:31:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-13 09:31:01,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.376 [2022-12-13 09:31:01,160 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 291 flow. Second operand 5 states and 47 transitions. [2022-12-13 09:31:01,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 431 flow [2022-12-13 09:31:01,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 383 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 09:31:01,163 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 247 flow [2022-12-13 09:31:01,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-13 09:31:01,163 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2022-12-13 09:31:01,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:01,164 INFO L89 Accepts]: Start accepts. Operand has 48 places, 35 transitions, 247 flow [2022-12-13 09:31:01,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:01,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:01,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 247 flow [2022-12-13 09:31:01,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 247 flow [2022-12-13 09:31:01,181 INFO L130 PetriNetUnfolder]: 36/132 cut-off events. [2022-12-13 09:31:01,182 INFO L131 PetriNetUnfolder]: For 219/225 co-relation queries the response was YES. [2022-12-13 09:31:01,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 132 events. 36/132 cut-off events. For 219/225 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 719 event pairs, 3 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 479. Up to 52 conditions per place. [2022-12-13 09:31:01,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 247 flow [2022-12-13 09:31:01,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 09:31:01,186 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:01,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 09:31:01,187 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 247 flow [2022-12-13 09:31:01,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:01,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:01,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:01,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 09:31:01,187 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash -370472817, now seen corresponding path program 1 times [2022-12-13 09:31:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:01,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914824102] [2022-12-13 09:31:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:01,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:01,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914824102] [2022-12-13 09:31:01,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914824102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:01,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:01,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897518390] [2022-12-13 09:31:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:01,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:31:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:31:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:31:01,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 09:31:01,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:01,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:01,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 09:31:01,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:01,647 INFO L130 PetriNetUnfolder]: 125/287 cut-off events. [2022-12-13 09:31:01,647 INFO L131 PetriNetUnfolder]: For 688/710 co-relation queries the response was YES. [2022-12-13 09:31:01,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 287 events. 125/287 cut-off events. For 688/710 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1407 event pairs, 47 based on Foata normal form. 20/255 useless extension candidates. Maximal degree in co-relation 1227. Up to 157 conditions per place. [2022-12-13 09:31:01,651 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 23 selfloop transitions, 7 changer transitions 10/45 dead transitions. [2022-12-13 09:31:01,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 383 flow [2022-12-13 09:31:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-13 09:31:01,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-13 09:31:01,653 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 247 flow. Second operand 5 states and 46 transitions. [2022-12-13 09:31:01,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 383 flow [2022-12-13 09:31:01,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 344 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-13 09:31:01,655 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 199 flow [2022-12-13 09:31:01,656 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-12-13 09:31:01,656 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2022-12-13 09:31:01,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:01,656 INFO L89 Accepts]: Start accepts. Operand has 44 places, 32 transitions, 199 flow [2022-12-13 09:31:01,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:01,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:01,658 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 199 flow [2022-12-13 09:31:01,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 199 flow [2022-12-13 09:31:01,674 INFO L130 PetriNetUnfolder]: 34/120 cut-off events. [2022-12-13 09:31:01,675 INFO L131 PetriNetUnfolder]: For 152/155 co-relation queries the response was YES. [2022-12-13 09:31:01,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 120 events. 34/120 cut-off events. For 152/155 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 596 event pairs, 6 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 395. Up to 49 conditions per place. [2022-12-13 09:31:01,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 199 flow [2022-12-13 09:31:01,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 09:31:01,690 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:01,694 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 09:31:01,694 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 199 flow [2022-12-13 09:31:01,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:01,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:01,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:01,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 09:31:01,695 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1448356366, now seen corresponding path program 1 times [2022-12-13 09:31:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337144569] [2022-12-13 09:31:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:02,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:02,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337144569] [2022-12-13 09:31:02,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337144569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:02,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:02,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:31:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534983242] [2022-12-13 09:31:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:02,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:31:02,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:02,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:31:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:31:02,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 09:31:02,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:02,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 09:31:02,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:02,672 INFO L130 PetriNetUnfolder]: 97/245 cut-off events. [2022-12-13 09:31:02,672 INFO L131 PetriNetUnfolder]: For 588/603 co-relation queries the response was YES. [2022-12-13 09:31:02,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 245 events. 97/245 cut-off events. For 588/603 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1260 event pairs, 9 based on Foata normal form. 20/223 useless extension candidates. Maximal degree in co-relation 1027. Up to 107 conditions per place. [2022-12-13 09:31:02,674 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 20 selfloop transitions, 10 changer transitions 14/49 dead transitions. [2022-12-13 09:31:02,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 386 flow [2022-12-13 09:31:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:31:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:31:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-13 09:31:02,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2022-12-13 09:31:02,675 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 199 flow. Second operand 7 states and 60 transitions. [2022-12-13 09:31:02,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 386 flow [2022-12-13 09:31:02,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 357 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-13 09:31:02,677 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 217 flow [2022-12-13 09:31:02,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 09:31:02,678 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2022-12-13 09:31:02,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:02,678 INFO L89 Accepts]: Start accepts. Operand has 46 places, 33 transitions, 217 flow [2022-12-13 09:31:02,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:02,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:02,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 217 flow [2022-12-13 09:31:02,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 217 flow [2022-12-13 09:31:02,691 INFO L130 PetriNetUnfolder]: 37/118 cut-off events. [2022-12-13 09:31:02,691 INFO L131 PetriNetUnfolder]: For 227/233 co-relation queries the response was YES. [2022-12-13 09:31:02,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 118 events. 37/118 cut-off events. For 227/233 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 546 event pairs, 12 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 440. Up to 49 conditions per place. [2022-12-13 09:31:02,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 217 flow [2022-12-13 09:31:02,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 09:31:03,625 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:31:03,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 948 [2022-12-13 09:31:03,626 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 241 flow [2022-12-13 09:31:03,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:03,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:03,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:03,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 09:31:03,626 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash -368849533, now seen corresponding path program 1 times [2022-12-13 09:31:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:03,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736312105] [2022-12-13 09:31:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:03,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:03,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736312105] [2022-12-13 09:31:03,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736312105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:03,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:03,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841060808] [2022-12-13 09:31:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:03,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:31:03,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:31:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:31:03,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 09:31:03,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:03,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:03,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 09:31:03,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:04,086 INFO L130 PetriNetUnfolder]: 47/139 cut-off events. [2022-12-13 09:31:04,086 INFO L131 PetriNetUnfolder]: For 621/630 co-relation queries the response was YES. [2022-12-13 09:31:04,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 139 events. 47/139 cut-off events. For 621/630 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 622 event pairs, 21 based on Foata normal form. 3/121 useless extension candidates. Maximal degree in co-relation 691. Up to 116 conditions per place. [2022-12-13 09:31:04,088 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 21 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2022-12-13 09:31:04,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 33 transitions, 297 flow [2022-12-13 09:31:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 09:31:04,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30833333333333335 [2022-12-13 09:31:04,089 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 241 flow. Second operand 5 states and 37 transitions. [2022-12-13 09:31:04,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 33 transitions, 297 flow [2022-12-13 09:31:04,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 268 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 09:31:04,091 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 232 flow [2022-12-13 09:31:04,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-13 09:31:04,092 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2022-12-13 09:31:04,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:04,092 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 232 flow [2022-12-13 09:31:04,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:04,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:04,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 232 flow [2022-12-13 09:31:04,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 232 flow [2022-12-13 09:31:04,125 INFO L130 PetriNetUnfolder]: 25/112 cut-off events. [2022-12-13 09:31:04,125 INFO L131 PetriNetUnfolder]: For 263/278 co-relation queries the response was YES. [2022-12-13 09:31:04,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 112 events. 25/112 cut-off events. For 263/278 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 565 event pairs, 9 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 433. Up to 58 conditions per place. [2022-12-13 09:31:04,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 232 flow [2022-12-13 09:31:04,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 09:31:04,127 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:04,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 09:31:04,128 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 232 flow [2022-12-13 09:31:04,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:04,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:04,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:04,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 09:31:04,129 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:04,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2137278499, now seen corresponding path program 1 times [2022-12-13 09:31:04,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:04,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619158664] [2022-12-13 09:31:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:04,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:04,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-13 09:31:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:04,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619158664] [2022-12-13 09:31:04,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619158664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:04,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:04,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:31:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263941308] [2022-12-13 09:31:04,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:04,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:31:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:31:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:31:04,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 09:31:04,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:04,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:04,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 09:31:04,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:04,784 INFO L130 PetriNetUnfolder]: 25/121 cut-off events. [2022-12-13 09:31:04,784 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2022-12-13 09:31:04,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 121 events. 25/121 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 635 event pairs, 21 based on Foata normal form. 18/121 useless extension candidates. Maximal degree in co-relation 552. Up to 64 conditions per place. [2022-12-13 09:31:04,785 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 11 selfloop transitions, 4 changer transitions 15/33 dead transitions. [2022-12-13 09:31:04,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 33 transitions, 286 flow [2022-12-13 09:31:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 09:31:04,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 09:31:04,786 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 232 flow. Second operand 5 states and 44 transitions. [2022-12-13 09:31:04,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 33 transitions, 286 flow [2022-12-13 09:31:04,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 268 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 09:31:04,787 INFO L231 Difference]: Finished difference. Result has 44 places, 18 transitions, 109 flow [2022-12-13 09:31:04,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=18} [2022-12-13 09:31:04,788 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2022-12-13 09:31:04,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:04,788 INFO L89 Accepts]: Start accepts. Operand has 44 places, 18 transitions, 109 flow [2022-12-13 09:31:04,788 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:04,788 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:04,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 18 transitions, 109 flow [2022-12-13 09:31:04,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 18 transitions, 109 flow [2022-12-13 09:31:04,793 INFO L130 PetriNetUnfolder]: 1/32 cut-off events. [2022-12-13 09:31:04,793 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 09:31:04,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 32 events. 1/32 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 82 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 102. Up to 12 conditions per place. [2022-12-13 09:31:04,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 18 transitions, 109 flow [2022-12-13 09:31:04,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 18 Received shutdown request... [2022-12-13 09:38:10,011 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 09:38:11,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown