/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/safe031_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:38:05,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:38:05,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:38:05,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:38:05,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:38:05,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:38:05,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:38:05,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:38:05,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:38:05,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:38:05,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:38:05,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:38:05,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:38:05,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:38:05,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:38:05,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:38:05,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:38:05,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:38:05,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:38:05,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:38:05,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:38:05,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:38:05,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:38:05,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:38:05,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:38:05,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:38:05,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:38:05,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:38:05,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:38:05,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:38:05,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:38:05,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:38:05,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:38:05,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:38:05,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:38:05,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:38:05,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:38:05,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:38:05,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:38:05,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:38:05,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:38:05,343 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:38:05,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:38:05,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:38:05,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:38:05,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:38:05,367 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:38:05,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:38:05,367 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:38:05,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:38:05,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:38:05,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:38:05,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:38:05,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:38:05,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:38:05,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:38:05,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:38:05,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:38:05,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:38:05,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:38:05,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:38:05,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:38:05,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:38:05,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:05,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:38:05,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:38:05,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:38:05,370 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:38:05,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:38:05,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:38:05,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:38:05,370 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:38:05,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:38:05,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:38:05,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:38:05,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:38:05,663 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:38:05,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 09:38:07,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:38:07,250 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:38:07,250 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 09:38:07,259 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf69f6a2/609c9ddbf7f54edda878bad97e2ba561/FLAG2d17968fe [2022-12-13 09:38:07,274 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf69f6a2/609c9ddbf7f54edda878bad97e2ba561 [2022-12-13 09:38:07,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:38:07,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:38:07,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:07,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:38:07,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:38:07,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:07,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c905a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07, skipping insertion in model container [2022-12-13 09:38:07,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:07,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:38:07,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:38:07,468 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-13 09:38:07,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:07,758 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:38:07,770 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-13 09:38:07,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:07,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:07,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:07,880 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:38:07,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07 WrapperNode [2022-12-13 09:38:07,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:07,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:07,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:38:07,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:38:07,890 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:38:07" (1/1) ... [2022-12-13 09:38:07,926 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:38:07" (1/1) ... [2022-12-13 09:38:07,959 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 09:38:07,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:07,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:38:07,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:38:07,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:38:07,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:07,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:07,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:07,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:07,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:07,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:08,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:08,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:08,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:38:08,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:38:08,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:38:08,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:38:08,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (1/1) ... [2022-12-13 09:38:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:38:08,050 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:38:08,099 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:38:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:38:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:38:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:38:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:38:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:38:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:38:08,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:38:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:38:08,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:38:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:38:08,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:38:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:38:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:38:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:38:08,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:38:08,136 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:38:08,323 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:38:08,325 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:38:08,586 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:38:08,697 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:38:08,698 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:38:08,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:08 BoogieIcfgContainer [2022-12-13 09:38:08,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:38:08,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:38:08,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:38:08,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:38:08,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:38:07" (1/3) ... [2022-12-13 09:38:08,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce57fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:08, skipping insertion in model container [2022-12-13 09:38:08,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:07" (2/3) ... [2022-12-13 09:38:08,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce57fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:08, skipping insertion in model container [2022-12-13 09:38:08,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:08" (3/3) ... [2022-12-13 09:38:08,707 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 09:38:08,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:38:08,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:38:08,738 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:38:08,806 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:38:08,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 09:38:08,908 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 09:38:08,908 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:08,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:38:08,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 09:38:08,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-13 09:38:08,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:08,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 09:38:08,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-13 09:38:08,990 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 09:38:08,990 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:08,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:38:08,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 09:38:08,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-13 09:38:13,654 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-13 09:38:13,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:38:13,690 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;@2587e0d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:38:13,690 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:38:13,694 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 09:38:13,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:13,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:13,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:38:13,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash 443507454, now seen corresponding path program 1 times [2022-12-13 09:38:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:13,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210605740] [2022-12-13 09:38:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:14,062 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:38:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:14,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210605740] [2022-12-13 09:38:14,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210605740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:14,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:14,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:38:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127585894] [2022-12-13 09:38:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:14,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:14,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 59 [2022-12-13 09:38:14,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:14,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:14,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 59 [2022-12-13 09:38:14,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:15,053 INFO L130 PetriNetUnfolder]: 7624/12094 cut-off events. [2022-12-13 09:38:15,054 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 09:38:15,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23071 conditions, 12094 events. 7624/12094 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 84430 event pairs, 2133 based on Foata normal form. 0/7427 useless extension candidates. Maximal degree in co-relation 23060. Up to 9237 conditions per place. [2022-12-13 09:38:15,088 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 32 selfloop transitions, 2 changer transitions 50/95 dead transitions. [2022-12-13 09:38:15,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 370 flow [2022-12-13 09:38:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-12-13 09:38:15,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2022-12-13 09:38:15,099 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 127 flow. Second operand 3 states and 120 transitions. [2022-12-13 09:38:15,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 370 flow [2022-12-13 09:38:15,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:15,103 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 74 flow [2022-12-13 09:38:15,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2022-12-13 09:38:15,107 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-13 09:38:15,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:15,108 INFO L89 Accepts]: Start accepts. Operand has 66 places, 32 transitions, 74 flow [2022-12-13 09:38:15,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:15,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:15,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 32 transitions, 74 flow [2022-12-13 09:38:15,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 09:38:15,114 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 09:38:15,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:15,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 70 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:38:15,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 09:38:15,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 09:38:15,284 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:15,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 09:38:15,285 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 09:38:15,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:15,286 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:15,286 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:15,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:38:15,286 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1012540175, now seen corresponding path program 1 times [2022-12-13 09:38:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:15,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941670532] [2022-12-13 09:38:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:15,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:15,441 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:38:15,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:15,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941670532] [2022-12-13 09:38:15,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941670532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:15,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:15,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:38:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668184341] [2022-12-13 09:38:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:15,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:15,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:38:15,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:15,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:15,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:38:15,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:16,022 INFO L130 PetriNetUnfolder]: 3465/5457 cut-off events. [2022-12-13 09:38:16,022 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-13 09:38:16,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10926 conditions, 5457 events. 3465/5457 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 32677 event pairs, 1253 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 10916. Up to 2731 conditions per place. [2022-12-13 09:38:16,041 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 37 selfloop transitions, 6 changer transitions 2/53 dead transitions. [2022-12-13 09:38:16,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 212 flow [2022-12-13 09:38:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 09:38:16,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2022-12-13 09:38:16,044 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 70 transitions. [2022-12-13 09:38:16,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 212 flow [2022-12-13 09:38:16,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:16,046 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 114 flow [2022-12-13 09:38:16,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-13 09:38:16,046 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -26 predicate places. [2022-12-13 09:38:16,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:16,047 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 114 flow [2022-12-13 09:38:16,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:16,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:16,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 114 flow [2022-12-13 09:38:16,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 114 flow [2022-12-13 09:38:16,063 INFO L130 PetriNetUnfolder]: 48/235 cut-off events. [2022-12-13 09:38:16,064 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 09:38:16,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 235 events. 48/235 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1520 event pairs, 20 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 384. Up to 61 conditions per place. [2022-12-13 09:38:16,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 114 flow [2022-12-13 09:38:16,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 09:38:16,146 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:16,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 09:38:16,147 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 114 flow [2022-12-13 09:38:16,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:16,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:16,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:16,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:38:16,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1323975349, now seen corresponding path program 1 times [2022-12-13 09:38:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:16,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684817765] [2022-12-13 09:38:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:16,289 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:38:16,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:16,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684817765] [2022-12-13 09:38:16,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684817765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:16,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:16,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92325994] [2022-12-13 09:38:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:16,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:16,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:16,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:38:16,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:16,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:16,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:38:16,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:16,689 INFO L130 PetriNetUnfolder]: 2660/4267 cut-off events. [2022-12-13 09:38:16,689 INFO L131 PetriNetUnfolder]: For 1203/1203 co-relation queries the response was YES. [2022-12-13 09:38:16,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10065 conditions, 4267 events. 2660/4267 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24667 event pairs, 408 based on Foata normal form. 8/3538 useless extension candidates. Maximal degree in co-relation 10053. Up to 2029 conditions per place. [2022-12-13 09:38:16,719 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 44 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2022-12-13 09:38:16,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 296 flow [2022-12-13 09:38:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 09:38:16,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6854838709677419 [2022-12-13 09:38:16,721 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 114 flow. Second operand 4 states and 85 transitions. [2022-12-13 09:38:16,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 296 flow [2022-12-13 09:38:16,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:16,728 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 162 flow [2022-12-13 09:38:16,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-13 09:38:16,729 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2022-12-13 09:38:16,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:16,729 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 162 flow [2022-12-13 09:38:16,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:16,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:16,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 162 flow [2022-12-13 09:38:16,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 162 flow [2022-12-13 09:38:16,748 INFO L130 PetriNetUnfolder]: 42/214 cut-off events. [2022-12-13 09:38:16,748 INFO L131 PetriNetUnfolder]: For 73/106 co-relation queries the response was YES. [2022-12-13 09:38:16,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 214 events. 42/214 cut-off events. For 73/106 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1335 event pairs, 11 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 396. Up to 53 conditions per place. [2022-12-13 09:38:16,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 162 flow [2022-12-13 09:38:16,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-13 09:38:16,848 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:16,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 09:38:16,849 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 162 flow [2022-12-13 09:38:16,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:16,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:16,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:16,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:38:16,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1323975628, now seen corresponding path program 1 times [2022-12-13 09:38:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:16,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446117657] [2022-12-13 09:38:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:16,938 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:38:16,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:16,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446117657] [2022-12-13 09:38:16,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446117657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:16,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698898285] [2022-12-13 09:38:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:16,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:16,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:38:16,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:16,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:16,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:38:16,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:17,271 INFO L130 PetriNetUnfolder]: 2598/4154 cut-off events. [2022-12-13 09:38:17,272 INFO L131 PetriNetUnfolder]: For 1803/1803 co-relation queries the response was YES. [2022-12-13 09:38:17,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10424 conditions, 4154 events. 2598/4154 cut-off events. For 1803/1803 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23863 event pairs, 396 based on Foata normal form. 6/3435 useless extension candidates. Maximal degree in co-relation 10410. Up to 2051 conditions per place. [2022-12-13 09:38:17,290 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 49 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2022-12-13 09:38:17,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 368 flow [2022-12-13 09:38:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 09:38:17,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7016129032258065 [2022-12-13 09:38:17,292 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 162 flow. Second operand 4 states and 87 transitions. [2022-12-13 09:38:17,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 368 flow [2022-12-13 09:38:17,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:17,295 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 250 flow [2022-12-13 09:38:17,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-13 09:38:17,296 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -18 predicate places. [2022-12-13 09:38:17,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:17,296 INFO L89 Accepts]: Start accepts. Operand has 51 places, 46 transitions, 250 flow [2022-12-13 09:38:17,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:17,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:17,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 250 flow [2022-12-13 09:38:17,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 250 flow [2022-12-13 09:38:17,312 INFO L130 PetriNetUnfolder]: 35/193 cut-off events. [2022-12-13 09:38:17,312 INFO L131 PetriNetUnfolder]: For 207/250 co-relation queries the response was YES. [2022-12-13 09:38:17,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 193 events. 35/193 cut-off events. For 207/250 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1168 event pairs, 6 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 441. Up to 46 conditions per place. [2022-12-13 09:38:17,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 250 flow [2022-12-13 09:38:17,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-13 09:38:17,344 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:17,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 09:38:17,345 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 250 flow [2022-12-13 09:38:17,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:17,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:17,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:17,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:38:17,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1906435866, now seen corresponding path program 1 times [2022-12-13 09:38:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589937570] [2022-12-13 09:38:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:17,423 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:38:17,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:17,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589937570] [2022-12-13 09:38:17,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589937570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:17,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:17,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:17,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363358418] [2022-12-13 09:38:17,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:17,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:17,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:17,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:17,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:38:17,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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:38:17,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:17,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:38:17,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:17,801 INFO L130 PetriNetUnfolder]: 3106/4955 cut-off events. [2022-12-13 09:38:17,801 INFO L131 PetriNetUnfolder]: For 5141/5196 co-relation queries the response was YES. [2022-12-13 09:38:17,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13054 conditions, 4955 events. 3106/4955 cut-off events. For 5141/5196 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 29138 event pairs, 882 based on Foata normal form. 107/3478 useless extension candidates. Maximal degree in co-relation 13035. Up to 4657 conditions per place. [2022-12-13 09:38:17,821 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 47 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2022-12-13 09:38:17,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 478 flow [2022-12-13 09:38:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 09:38:17,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2022-12-13 09:38:17,822 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 250 flow. Second operand 3 states and 65 transitions. [2022-12-13 09:38:17,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 478 flow [2022-12-13 09:38:17,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:17,827 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 318 flow [2022-12-13 09:38:17,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2022-12-13 09:38:17,828 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -15 predicate places. [2022-12-13 09:38:17,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:17,828 INFO L89 Accepts]: Start accepts. Operand has 54 places, 55 transitions, 318 flow [2022-12-13 09:38:17,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:17,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:17,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 318 flow [2022-12-13 09:38:17,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 318 flow [2022-12-13 09:38:17,904 INFO L130 PetriNetUnfolder]: 760/1662 cut-off events. [2022-12-13 09:38:17,904 INFO L131 PetriNetUnfolder]: For 712/733 co-relation queries the response was YES. [2022-12-13 09:38:17,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 1662 events. 760/1662 cut-off events. For 712/733 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 13154 event pairs, 305 based on Foata normal form. 4/939 useless extension candidates. Maximal degree in co-relation 3589. Up to 1216 conditions per place. [2022-12-13 09:38:17,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 318 flow [2022-12-13 09:38:17,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 898 [2022-12-13 09:38:17,945 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:17,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 09:38:17,946 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 318 flow [2022-12-13 09:38:17,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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:38:17,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:17,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:17,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:38:17,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:17,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1926664405, now seen corresponding path program 1 times [2022-12-13 09:38:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:17,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459008843] [2022-12-13 09:38:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:18,077 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:38:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:18,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459008843] [2022-12-13 09:38:18,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459008843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:18,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:18,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294613573] [2022-12-13 09:38:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:18,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:18,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:18,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:38:18,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:18,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:18,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:38:18,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:18,429 INFO L130 PetriNetUnfolder]: 1555/2855 cut-off events. [2022-12-13 09:38:18,430 INFO L131 PetriNetUnfolder]: For 2880/2899 co-relation queries the response was YES. [2022-12-13 09:38:18,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9334 conditions, 2855 events. 1555/2855 cut-off events. For 2880/2899 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18152 event pairs, 207 based on Foata normal form. 195/2156 useless extension candidates. Maximal degree in co-relation 9312. Up to 2035 conditions per place. [2022-12-13 09:38:18,444 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 57 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2022-12-13 09:38:18,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 657 flow [2022-12-13 09:38:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 09:38:18,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717741935483871 [2022-12-13 09:38:18,446 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 318 flow. Second operand 4 states and 89 transitions. [2022-12-13 09:38:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 657 flow [2022-12-13 09:38:18,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:38:18,454 INFO L231 Difference]: Finished difference. Result has 57 places, 64 transitions, 420 flow [2022-12-13 09:38:18,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=57, PETRI_TRANSITIONS=64} [2022-12-13 09:38:18,455 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -12 predicate places. [2022-12-13 09:38:18,455 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:18,456 INFO L89 Accepts]: Start accepts. Operand has 57 places, 64 transitions, 420 flow [2022-12-13 09:38:18,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:18,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:18,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 64 transitions, 420 flow [2022-12-13 09:38:18,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 64 transitions, 420 flow [2022-12-13 09:38:18,546 INFO L130 PetriNetUnfolder]: 442/1185 cut-off events. [2022-12-13 09:38:18,547 INFO L131 PetriNetUnfolder]: For 649/757 co-relation queries the response was YES. [2022-12-13 09:38:18,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3565 conditions, 1185 events. 442/1185 cut-off events. For 649/757 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 9543 event pairs, 56 based on Foata normal form. 10/740 useless extension candidates. Maximal degree in co-relation 3544. Up to 811 conditions per place. [2022-12-13 09:38:18,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 64 transitions, 420 flow [2022-12-13 09:38:18,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-13 09:38:18,567 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:18,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 09:38:18,568 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 64 transitions, 420 flow [2022-12-13 09:38:18,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:18,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:18,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:18,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:38:18,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash -466001028, now seen corresponding path program 1 times [2022-12-13 09:38:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:18,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721054647] [2022-12-13 09:38:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:18,723 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:38:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:18,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721054647] [2022-12-13 09:38:18,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721054647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:18,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:18,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609689487] [2022-12-13 09:38:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:18,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:18,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:38:18,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 64 transitions, 420 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:38:18,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:18,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:38:18,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:19,222 INFO L130 PetriNetUnfolder]: 2240/4185 cut-off events. [2022-12-13 09:38:19,223 INFO L131 PetriNetUnfolder]: For 6959/7289 co-relation queries the response was YES. [2022-12-13 09:38:19,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 4185 events. 2240/4185 cut-off events. For 6959/7289 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 30117 event pairs, 394 based on Foata normal form. 266/3708 useless extension candidates. Maximal degree in co-relation 16005. Up to 2392 conditions per place. [2022-12-13 09:38:19,243 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 69 selfloop transitions, 13 changer transitions 23/119 dead transitions. [2022-12-13 09:38:19,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 119 transitions, 951 flow [2022-12-13 09:38:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 09:38:19,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7338709677419355 [2022-12-13 09:38:19,245 INFO L175 Difference]: Start difference. First operand has 57 places, 64 transitions, 420 flow. Second operand 4 states and 91 transitions. [2022-12-13 09:38:19,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 119 transitions, 951 flow [2022-12-13 09:38:19,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 119 transitions, 865 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:19,254 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 408 flow [2022-12-13 09:38:19,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=408, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2022-12-13 09:38:19,255 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -9 predicate places. [2022-12-13 09:38:19,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:19,255 INFO L89 Accepts]: Start accepts. Operand has 60 places, 61 transitions, 408 flow [2022-12-13 09:38:19,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:19,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:19,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 61 transitions, 408 flow [2022-12-13 09:38:19,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 61 transitions, 408 flow [2022-12-13 09:38:19,382 INFO L130 PetriNetUnfolder]: 720/1683 cut-off events. [2022-12-13 09:38:19,382 INFO L131 PetriNetUnfolder]: For 1142/1244 co-relation queries the response was YES. [2022-12-13 09:38:19,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4592 conditions, 1683 events. 720/1683 cut-off events. For 1142/1244 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 13765 event pairs, 110 based on Foata normal form. 12/929 useless extension candidates. Maximal degree in co-relation 4569. Up to 1297 conditions per place. [2022-12-13 09:38:19,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 61 transitions, 408 flow [2022-12-13 09:38:19,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-13 09:38:19,407 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:19,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 09:38:19,408 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 408 flow [2022-12-13 09:38:19,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:38:19,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:19,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:19,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:38:19,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2135048860, now seen corresponding path program 1 times [2022-12-13 09:38:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:19,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794321014] [2022-12-13 09:38:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:19,545 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:38:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794321014] [2022-12-13 09:38:19,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794321014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:19,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:19,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524095034] [2022-12-13 09:38:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:19,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:19,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 09:38:19,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:19,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:19,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 09:38:19,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:20,016 INFO L130 PetriNetUnfolder]: 2588/4942 cut-off events. [2022-12-13 09:38:20,016 INFO L131 PetriNetUnfolder]: For 8016/8348 co-relation queries the response was YES. [2022-12-13 09:38:20,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17170 conditions, 4942 events. 2588/4942 cut-off events. For 8016/8348 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 38104 event pairs, 820 based on Foata normal form. 288/4258 useless extension candidates. Maximal degree in co-relation 17144. Up to 2789 conditions per place. [2022-12-13 09:38:20,035 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 54 selfloop transitions, 3 changer transitions 10/84 dead transitions. [2022-12-13 09:38:20,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 652 flow [2022-12-13 09:38:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 09:38:20,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2022-12-13 09:38:20,036 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 408 flow. Second operand 3 states and 63 transitions. [2022-12-13 09:38:20,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 652 flow [2022-12-13 09:38:20,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 617 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:20,045 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 365 flow [2022-12-13 09:38:20,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=365, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2022-12-13 09:38:20,046 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -9 predicate places. [2022-12-13 09:38:20,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:20,046 INFO L89 Accepts]: Start accepts. Operand has 60 places, 59 transitions, 365 flow [2022-12-13 09:38:20,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:20,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:20,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 59 transitions, 365 flow [2022-12-13 09:38:20,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 365 flow [2022-12-13 09:38:20,142 INFO L130 PetriNetUnfolder]: 716/1706 cut-off events. [2022-12-13 09:38:20,142 INFO L131 PetriNetUnfolder]: For 1258/1358 co-relation queries the response was YES. [2022-12-13 09:38:20,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 1706 events. 716/1706 cut-off events. For 1258/1358 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 14317 event pairs, 118 based on Foata normal form. 12/926 useless extension candidates. Maximal degree in co-relation 4578. Up to 1324 conditions per place. [2022-12-13 09:38:20,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 59 transitions, 365 flow [2022-12-13 09:38:20,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-13 09:38:20,161 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:20,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 09:38:20,162 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 365 flow [2022-12-13 09:38:20,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:20,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:20,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:20,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:38:20,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash -448924940, now seen corresponding path program 2 times [2022-12-13 09:38:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:20,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075263022] [2022-12-13 09:38:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:20,281 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:38:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:20,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075263022] [2022-12-13 09:38:20,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075263022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:20,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:20,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279501892] [2022-12-13 09:38:20,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:20,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:20,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:20,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:20,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:38:20,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:38:20,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:20,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:38:20,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:20,475 INFO L130 PetriNetUnfolder]: 1133/2245 cut-off events. [2022-12-13 09:38:20,475 INFO L131 PetriNetUnfolder]: For 1960/1970 co-relation queries the response was YES. [2022-12-13 09:38:20,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7925 conditions, 2245 events. 1133/2245 cut-off events. For 1960/1970 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14845 event pairs, 77 based on Foata normal form. 289/1667 useless extension candidates. Maximal degree in co-relation 7900. Up to 1063 conditions per place. [2022-12-13 09:38:20,483 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 25 selfloop transitions, 28 changer transitions 26/84 dead transitions. [2022-12-13 09:38:20,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 666 flow [2022-12-13 09:38:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:38:20,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2022-12-13 09:38:20,484 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 365 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:38:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 666 flow [2022-12-13 09:38:20,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 648 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:20,488 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 324 flow [2022-12-13 09:38:20,488 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2022-12-13 09:38:20,488 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2022-12-13 09:38:20,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:20,488 INFO L89 Accepts]: Start accepts. Operand has 62 places, 47 transitions, 324 flow [2022-12-13 09:38:20,489 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:20,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:20,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 47 transitions, 324 flow [2022-12-13 09:38:20,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 47 transitions, 324 flow [2022-12-13 09:38:20,501 INFO L130 PetriNetUnfolder]: 81/242 cut-off events. [2022-12-13 09:38:20,501 INFO L131 PetriNetUnfolder]: For 103/115 co-relation queries the response was YES. [2022-12-13 09:38:20,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 242 events. 81/242 cut-off events. For 103/115 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1370 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 859. Up to 163 conditions per place. [2022-12-13 09:38:20,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 47 transitions, 324 flow [2022-12-13 09:38:20,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 09:38:21,290 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:38:21,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 803 [2022-12-13 09:38:21,291 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 302 flow [2022-12-13 09:38:21,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:38:21,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:21,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:21,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:38:21,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:21,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1932279150, now seen corresponding path program 1 times [2022-12-13 09:38:21,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:21,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284280610] [2022-12-13 09:38:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:21,571 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:38:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284280610] [2022-12-13 09:38:21,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284280610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:21,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:21,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803489171] [2022-12-13 09:38:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:21,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:38:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:38:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:38:21,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 09:38:21,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:21,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:21,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 09:38:21,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:21,714 INFO L130 PetriNetUnfolder]: 269/515 cut-off events. [2022-12-13 09:38:21,714 INFO L131 PetriNetUnfolder]: For 1074/1101 co-relation queries the response was YES. [2022-12-13 09:38:21,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 515 events. 269/515 cut-off events. For 1074/1101 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 2608 event pairs, 2 based on Foata normal form. 44/419 useless extension candidates. Maximal degree in co-relation 2395. Up to 370 conditions per place. [2022-12-13 09:38:21,716 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 52 selfloop transitions, 10 changer transitions 18/91 dead transitions. [2022-12-13 09:38:21,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 91 transitions, 802 flow [2022-12-13 09:38:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:38:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:38:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-13 09:38:21,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 09:38:21,718 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 302 flow. Second operand 8 states and 96 transitions. [2022-12-13 09:38:21,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 91 transitions, 802 flow [2022-12-13 09:38:21,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 91 transitions, 594 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-12-13 09:38:21,724 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 246 flow [2022-12-13 09:38:21,724 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-13 09:38:21,724 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -19 predicate places. [2022-12-13 09:38:21,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:21,725 INFO L89 Accepts]: Start accepts. Operand has 50 places, 47 transitions, 246 flow [2022-12-13 09:38:21,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:21,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:21,725 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 246 flow [2022-12-13 09:38:21,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 246 flow [2022-12-13 09:38:21,772 INFO L130 PetriNetUnfolder]: 102/239 cut-off events. [2022-12-13 09:38:21,772 INFO L131 PetriNetUnfolder]: For 316/316 co-relation queries the response was YES. [2022-12-13 09:38:21,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 239 events. 102/239 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1245 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 704. Up to 118 conditions per place. [2022-12-13 09:38:21,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 47 transitions, 246 flow [2022-12-13 09:38:21,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 09:38:21,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} 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 [327] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:38:23,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] $Ultimate##0-->L761: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd1~0_220 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd1~0_212 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse3 (and .cse7 (= (mod v_~x$w_buff1_used~0_428 256) 0))) (.cse12 (= (mod v_~x$w_buff0_used~0_468 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse1 (ite .cse5 v_~x~0_358 (ite .cse6 v_~x$w_buff0~0_281 v_~x$w_buff1~0_254))) (.cse0 (not (= (mod v_~weak$$choice2~0_119 256) 0))) (.cse8 (= (mod v_~x$w_buff1_used~0_427 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_467 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_93 .cse1) v_~x~0_357) (= v_~z~0_204 2) (= v_~x$w_buff1_used~0_427 (ite .cse0 v_~x$w_buff1_used~0_428 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_428 0))) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= v_~x$mem_tmp~0_93 v_~x~0_358) (= (ite .cse0 v_~x$w_buff0_used~0_468 (ite .cse5 v_~x$w_buff0_used~0_468 (ite .cse6 0 v_~x$w_buff0_used~0_468))) v_~x$w_buff0_used~0_467) (= v_~x$w_buff0~0_281 v_~x$w_buff0~0_280) (= .cse1 v_~__unbuffered_p0_EAX~0_241) (= (ite .cse0 v_~x$r_buff0_thd1~0_212 (ite (or (and .cse7 .cse8) .cse2 .cse4) v_~x$r_buff0_thd1~0_212 (ite (and (not .cse4) .cse9) 0 v_~x$r_buff0_thd1~0_212))) v_~x$r_buff0_thd1~0_211) (= v_~x$r_buff1_thd1~0_219 (ite .cse0 v_~x$r_buff1_thd1~0_220 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_211 256) 0))) (or (and .cse10 .cse8) (and .cse11 .cse10) .cse4)) v_~x$r_buff1_thd1~0_220 0))) (= v_~weak$$choice0~0_86 |v_P0Thread1of1ForFork1_#t~nondet3_132|) (= v_~x$w_buff1~0_254 v_~x$w_buff1~0_253) (= v_~x$flush_delayed~0_94 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27) (= v_~weak$$choice2~0_119 |v_P0Thread1of1ForFork1_#t~nondet4_132|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_281, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_212, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_254, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_428, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_220, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_132|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~x~0=v_~x~0_358, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_132|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_468} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_211, ~x$flush_delayed~0=v_~x$flush_delayed~0_94, ~x$w_buff1~0=v_~x$w_buff1~0_253, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_427, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_219, ~x$mem_tmp~0=v_~x$mem_tmp~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_467, ~weak$$choice0~0=v_~weak$$choice0~0_86, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_241, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~z~0=v_~z~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~x~0=v_~x~0_357} 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, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~z~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [465] L785-->L812: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd2~0_189 256) 0)))) (let ((.cse5 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_507 256) 0))))) (let ((.cse1 (ite .cse5 0 v_~x$w_buff0_used~0_507))) (let ((.cse7 (not (= (mod .cse1 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_157 256) 0)))) (let ((.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_465 256) 0)))) (.cse11 (and .cse7 .cse14))) (let ((.cse12 (ite (or .cse6 .cse11) 0 v_~x$w_buff1_used~0_465))) (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_505 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_160 256) 0))) (.cse9 (not (= (mod .cse12 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd3~0_163 256) 0)))) (let ((.cse0 (and .cse7 .cse13)) (.cse4 (and .cse3 .cse9)) (.cse10 (and .cse2 .cse13))) (and (= v_~x$w_buff0_used~0_505 (ite .cse0 0 .cse1)) (= (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_162 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_463 256) 0)))) 0 v_~x$r_buff1_thd3~0_160) v_~x$r_buff1_thd3~0_159) (= (ite .cse0 v_~x$w_buff0~0_304 (ite .cse4 v_~x$w_buff1~0_275 (ite .cse5 v_~x$w_buff0~0_304 (ite .cse6 v_~x$w_buff1~0_275 v_~x~0_395)))) v_~x~0_393) (= v_~x$r_buff1_thd2~0_156 (ite (or (and .cse7 (not (= (mod v_~x$r_buff0_thd2~0_188 256) 0))) (and .cse8 .cse9)) 0 v_~x$r_buff1_thd2~0_157)) (= (ite .cse10 0 v_~x$r_buff0_thd3~0_163) v_~x$r_buff0_thd3~0_162) (= (ite .cse11 0 v_~x$r_buff0_thd2~0_189) v_~x$r_buff0_thd2~0_188) (= (ite (or .cse4 .cse10) 0 .cse12) v_~x$w_buff1_used~0_463)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_304, ~x$w_buff1~0=v_~x$w_buff1~0_275, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_465, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_163, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_189, ~x~0=v_~x~0_395, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, ~x$w_buff1~0=v_~x$w_buff1~0_275, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_463, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_162, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_188, ~x~0=v_~x~0_393, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_505} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd3~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:38:23,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] $Ultimate##0-->L761: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd1~0_220 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd1~0_212 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse3 (and .cse7 (= (mod v_~x$w_buff1_used~0_428 256) 0))) (.cse12 (= (mod v_~x$w_buff0_used~0_468 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse1 (ite .cse5 v_~x~0_358 (ite .cse6 v_~x$w_buff0~0_281 v_~x$w_buff1~0_254))) (.cse0 (not (= (mod v_~weak$$choice2~0_119 256) 0))) (.cse8 (= (mod v_~x$w_buff1_used~0_427 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_467 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_93 .cse1) v_~x~0_357) (= v_~z~0_204 2) (= v_~x$w_buff1_used~0_427 (ite .cse0 v_~x$w_buff1_used~0_428 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_428 0))) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= v_~x$mem_tmp~0_93 v_~x~0_358) (= (ite .cse0 v_~x$w_buff0_used~0_468 (ite .cse5 v_~x$w_buff0_used~0_468 (ite .cse6 0 v_~x$w_buff0_used~0_468))) v_~x$w_buff0_used~0_467) (= v_~x$w_buff0~0_281 v_~x$w_buff0~0_280) (= .cse1 v_~__unbuffered_p0_EAX~0_241) (= (ite .cse0 v_~x$r_buff0_thd1~0_212 (ite (or (and .cse7 .cse8) .cse2 .cse4) v_~x$r_buff0_thd1~0_212 (ite (and (not .cse4) .cse9) 0 v_~x$r_buff0_thd1~0_212))) v_~x$r_buff0_thd1~0_211) (= v_~x$r_buff1_thd1~0_219 (ite .cse0 v_~x$r_buff1_thd1~0_220 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_211 256) 0))) (or (and .cse10 .cse8) (and .cse11 .cse10) .cse4)) v_~x$r_buff1_thd1~0_220 0))) (= v_~weak$$choice0~0_86 |v_P0Thread1of1ForFork1_#t~nondet3_132|) (= v_~x$w_buff1~0_254 v_~x$w_buff1~0_253) (= v_~x$flush_delayed~0_94 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27) (= v_~weak$$choice2~0_119 |v_P0Thread1of1ForFork1_#t~nondet4_132|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_281, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_212, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_254, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_428, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_220, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_132|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~x~0=v_~x~0_358, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_132|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_468} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_211, ~x$flush_delayed~0=v_~x$flush_delayed~0_94, ~x$w_buff1~0=v_~x$w_buff1~0_253, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_427, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_219, ~x$mem_tmp~0=v_~x$mem_tmp~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_467, ~weak$$choice0~0=v_~weak$$choice0~0_86, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_241, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~z~0=v_~z~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~x~0=v_~x~0_357} 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, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~z~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [327] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0]