/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/weaver/parallel-ticket-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:19:13,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:19:13,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:19:13,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:19:13,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:19:13,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:19:13,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:19:13,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:19:13,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:19:13,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:19:13,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:19:13,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:19:13,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:19:13,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:19:13,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:19:13,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:19:13,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:19:13,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:19:13,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:19:13,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:19:13,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:19:13,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:19:13,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:19:13,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:19:13,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:19:13,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:19:13,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:19:13,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:19:13,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:19:13,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:19:13,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:19:13,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:19:13,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:19:13,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:19:13,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:19:13,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:19:13,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:19:13,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:19:13,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:19:13,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:19:13,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:19:13,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:19:13,759 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:19:13,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:19:13,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:19:13,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:19:13,761 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:19:13,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:19:13,762 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:19:13,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:19:13,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:19:13,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:19:13,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:19:13,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:19:13,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:19:13,763 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:19:13,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:19:13,763 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:19:13,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:19:13,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:19:13,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:19:13,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:19:13,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:19:13,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:19:13,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:19:13,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:19:13,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:19:13,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:19:13,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:19:13,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:19:13,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:19:13,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:19:13,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:19:13,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:19:14,000 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:19:14,001 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:19:14,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2022-12-06 05:19:15,001 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:19:15,223 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:19:15,224 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2022-12-06 05:19:15,249 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8a715cd/fa688a5c292843bd98bafd177526cc1b/FLAG8ca12bfa2 [2022-12-06 05:19:15,263 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8a715cd/fa688a5c292843bd98bafd177526cc1b [2022-12-06 05:19:15,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:19:15,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:19:15,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:19:15,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:19:15,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:19:15,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356c00e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15, skipping insertion in model container [2022-12-06 05:19:15,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:19:15,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:19:15,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,440 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[3089,3102] [2022-12-06 05:19:15,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:19:15,456 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:19:15,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:15,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:15,495 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[3089,3102] [2022-12-06 05:19:15,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:19:15,512 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:19:15,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15 WrapperNode [2022-12-06 05:19:15,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:19:15,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:19:15,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:19:15,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:19:15,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,568 INFO L138 Inliner]: procedures = 22, calls = 55, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 158 [2022-12-06 05:19:15,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:19:15,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:19:15,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:19:15,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:19:15,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,597 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:19:15,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:19:15,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:19:15,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:19:15,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (1/1) ... [2022-12-06 05:19:15,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:19:15,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:19:15,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:19:15,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:19:15,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:19:15,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:19:15,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:19:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:19:15,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:19:15,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:19:15,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:19:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:19:15,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:19:15,673 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:19:15,766 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:19:15,768 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:19:16,023 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:19:16,097 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:19:16,097 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 05:19:16,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:19:16 BoogieIcfgContainer [2022-12-06 05:19:16,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:19:16,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:19:16,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:19:16,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:19:16,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:19:15" (1/3) ... [2022-12-06 05:19:16,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf5b4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:19:16, skipping insertion in model container [2022-12-06 05:19:16,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:15" (2/3) ... [2022-12-06 05:19:16,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf5b4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:19:16, skipping insertion in model container [2022-12-06 05:19:16,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:19:16" (3/3) ... [2022-12-06 05:19:16,108 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2022-12-06 05:19:16,127 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:19:16,128 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:19:16,128 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:19:16,201 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:19:16,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 248 flow [2022-12-06 05:19:16,282 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-06 05:19:16,282 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:19:16,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 05:19:16,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 248 flow [2022-12-06 05:19:16,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 216 flow [2022-12-06 05:19:16,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:16,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 216 flow [2022-12-06 05:19:16,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 216 flow [2022-12-06 05:19:16,380 INFO L130 PetriNetUnfolder]: 2/99 cut-off events. [2022-12-06 05:19:16,381 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:19:16,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 99 events. 2/99 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 05:19:16,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 216 flow [2022-12-06 05:19:16,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-06 05:19:20,774 INFO L203 LiptonReduction]: Total number of compositions: 79 [2022-12-06 05:19:20,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:19:20,788 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;@3ef80809, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:19:20,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:19:20,792 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 05:19:20,792 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:19:20,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:20,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:20,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 643367342, now seen corresponding path program 1 times [2022-12-06 05:19:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:20,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234910924] [2022-12-06 05:19:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:21,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:21,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234910924] [2022-12-06 05:19:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234910924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:21,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:21,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103686700] [2022-12-06 05:19:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:21,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:19:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:19:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:19:21,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:19:21,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 58 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:21,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:21,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:19:21,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:21,771 INFO L130 PetriNetUnfolder]: 228/429 cut-off events. [2022-12-06 05:19:21,771 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-06 05:19:21,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 429 events. 228/429 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1731 event pairs, 38 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 807. Up to 145 conditions per place. [2022-12-06 05:19:21,776 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 41 selfloop transitions, 10 changer transitions 13/64 dead transitions. [2022-12-06 05:19:21,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 64 transitions, 310 flow [2022-12-06 05:19:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:19:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:19:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 05:19:21,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 05:19:21,786 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 58 flow. Second operand 6 states and 66 transitions. [2022-12-06 05:19:21,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 64 transitions, 310 flow [2022-12-06 05:19:21,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 64 transitions, 274 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:19:21,795 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 115 flow [2022-12-06 05:19:21,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-06 05:19:21,799 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 05:19:21,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:21,800 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 115 flow [2022-12-06 05:19:21,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:21,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:21,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 115 flow [2022-12-06 05:19:21,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 115 flow [2022-12-06 05:19:21,808 INFO L130 PetriNetUnfolder]: 8/56 cut-off events. [2022-12-06 05:19:21,809 INFO L131 PetriNetUnfolder]: For 11/14 co-relation queries the response was YES. [2022-12-06 05:19:21,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 56 events. 8/56 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 1 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 84. Up to 13 conditions per place. [2022-12-06 05:19:21,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 115 flow [2022-12-06 05:19:21,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 05:19:21,810 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:21,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:19:21,811 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 115 flow [2022-12-06 05:19:21,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:21,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:21,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:21,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:19:21,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1360956606, now seen corresponding path program 2 times [2022-12-06 05:19:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:21,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504820275] [2022-12-06 05:19:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:21,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:21,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504820275] [2022-12-06 05:19:21,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504820275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:21,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:21,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:19:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906051494] [2022-12-06 05:19:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:21,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:19:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:21,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:19:21,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:19:21,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:19:21,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:21,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:21,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:19:21,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:22,106 INFO L130 PetriNetUnfolder]: 149/280 cut-off events. [2022-12-06 05:19:22,106 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-12-06 05:19:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 280 events. 149/280 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 986 event pairs, 30 based on Foata normal form. 12/292 useless extension candidates. Maximal degree in co-relation 593. Up to 214 conditions per place. [2022-12-06 05:19:22,108 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 39 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2022-12-06 05:19:22,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 283 flow [2022-12-06 05:19:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:19:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:19:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 05:19:22,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-06 05:19:22,110 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 115 flow. Second operand 5 states and 42 transitions. [2022-12-06 05:19:22,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 283 flow [2022-12-06 05:19:22,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 264 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:19:22,112 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 159 flow [2022-12-06 05:19:22,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-06 05:19:22,112 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-06 05:19:22,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:22,112 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 159 flow [2022-12-06 05:19:22,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:22,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:22,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 159 flow [2022-12-06 05:19:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 159 flow [2022-12-06 05:19:22,120 INFO L130 PetriNetUnfolder]: 13/68 cut-off events. [2022-12-06 05:19:22,120 INFO L131 PetriNetUnfolder]: For 35/36 co-relation queries the response was YES. [2022-12-06 05:19:22,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 68 events. 13/68 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 199 event pairs, 2 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 129. Up to 17 conditions per place. [2022-12-06 05:19:22,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 159 flow [2022-12-06 05:19:22,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 05:19:22,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [400] L86-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= v_~b~0_93 (ite (= (ite (or (= v_~x~0_64 1) (not (= (mod v_~b~0_94 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| (ite (<= v_~m3~0_41 v_~s~0_188) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= (+ v_~s~0_188 1) v_~s~0_187) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|)) InVars {~m3~0=v_~m3~0_41, ~b~0=v_~b~0_94, ~x~0=v_~x~0_64, ~s~0=v_~s~0_188} OutVars{~m3~0=v_~m3~0_41, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~b~0=v_~b~0_93, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_23|, ~x~0=v_~x~0_64, ~s~0=v_~s~0_187} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post6#1, ~s~0] and [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:19:22,209 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:22,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 05:19:22,210 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 162 flow [2022-12-06 05:19:22,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:22,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:22,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:19:22,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 847798462, now seen corresponding path program 3 times [2022-12-06 05:19:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:22,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391992424] [2022-12-06 05:19:22,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:22,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:22,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391992424] [2022-12-06 05:19:22,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391992424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:22,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:22,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:19:22,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464572868] [2022-12-06 05:19:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:22,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:19:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:19:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:19:22,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:19:22,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:22,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:19:22,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:22,453 INFO L130 PetriNetUnfolder]: 148/285 cut-off events. [2022-12-06 05:19:22,453 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2022-12-06 05:19:22,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 285 events. 148/285 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1005 event pairs, 10 based on Foata normal form. 14/299 useless extension candidates. Maximal degree in co-relation 497. Up to 163 conditions per place. [2022-12-06 05:19:22,455 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 33 selfloop transitions, 10 changer transitions 12/55 dead transitions. [2022-12-06 05:19:22,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 341 flow [2022-12-06 05:19:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:19:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:19:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-06 05:19:22,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36054421768707484 [2022-12-06 05:19:22,456 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 162 flow. Second operand 7 states and 53 transitions. [2022-12-06 05:19:22,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 341 flow [2022-12-06 05:19:22,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:19:22,458 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 181 flow [2022-12-06 05:19:22,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-06 05:19:22,458 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 05:19:22,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:22,458 INFO L89 Accepts]: Start accepts. Operand has 45 places, 32 transitions, 181 flow [2022-12-06 05:19:22,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:22,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:22,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 181 flow [2022-12-06 05:19:22,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 181 flow [2022-12-06 05:19:22,464 INFO L130 PetriNetUnfolder]: 11/55 cut-off events. [2022-12-06 05:19:22,464 INFO L131 PetriNetUnfolder]: For 62/64 co-relation queries the response was YES. [2022-12-06 05:19:22,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 55 events. 11/55 cut-off events. For 62/64 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 161 event pairs, 3 based on Foata normal form. 2/57 useless extension candidates. Maximal degree in co-relation 130. Up to 15 conditions per place. [2022-12-06 05:19:22,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 181 flow [2022-12-06 05:19:22,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 05:19:22,468 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:22,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:19:22,468 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 181 flow [2022-12-06 05:19:22,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:22,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:22,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:19:22,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 112401160, now seen corresponding path program 4 times [2022-12-06 05:19:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:22,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785000519] [2022-12-06 05:19:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785000519] [2022-12-06 05:19:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785000519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:22,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:22,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:19:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089563184] [2022-12-06 05:19:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:22,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:19:22,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:22,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:19:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:19:22,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:19:22,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:22,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:19:22,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:22,706 INFO L130 PetriNetUnfolder]: 129/260 cut-off events. [2022-12-06 05:19:22,706 INFO L131 PetriNetUnfolder]: For 393/393 co-relation queries the response was YES. [2022-12-06 05:19:22,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 260 events. 129/260 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 949 event pairs, 12 based on Foata normal form. 4/264 useless extension candidates. Maximal degree in co-relation 765. Up to 152 conditions per place. [2022-12-06 05:19:22,708 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 42 selfloop transitions, 19 changer transitions 2/63 dead transitions. [2022-12-06 05:19:22,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 444 flow [2022-12-06 05:19:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:19:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:19:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-12-06 05:19:22,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 05:19:22,710 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 181 flow. Second operand 8 states and 55 transitions. [2022-12-06 05:19:22,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 444 flow [2022-12-06 05:19:22,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 406 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-06 05:19:22,715 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 279 flow [2022-12-06 05:19:22,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=279, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-06 05:19:22,716 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2022-12-06 05:19:22,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:22,717 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 279 flow [2022-12-06 05:19:22,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:22,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:22,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 279 flow [2022-12-06 05:19:22,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 279 flow [2022-12-06 05:19:22,723 INFO L130 PetriNetUnfolder]: 14/67 cut-off events. [2022-12-06 05:19:22,723 INFO L131 PetriNetUnfolder]: For 86/88 co-relation queries the response was YES. [2022-12-06 05:19:22,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 67 events. 14/67 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 2 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 184. Up to 17 conditions per place. [2022-12-06 05:19:22,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 279 flow [2022-12-06 05:19:22,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 05:19:22,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_7 v_~t~0_44) (= (+ v_~t~0_44 1) v_~t~0_43)) InVars {~t~0=v_~t~0_44} OutVars{~m3~0=v_~m3~0_7, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_1|, ~t~0=v_~t~0_43} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [414] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_21| 0) (= v_~s~0_225 (+ v_~s~0_226 1)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_21| 0) (= v_~x~0_87 0)) InVars {~s~0=v_~s~0_226} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_23|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_21|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_21|, ~x~0=v_~x~0_87, ~s~0=v_~s~0_225} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:19:22,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [313] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_32) (= v_~t~0_31 (+ v_~t~0_32 1))) InVars {~t~0=v_~t~0_32} OutVars{thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3#1, ~m2~0, ~t~0] and [306] $Ultimate##0-->L45: Formula: (and (= v_~t~0_39 (+ v_~t~0_40 1)) (= v_~m1~0_9 v_~t~0_40)) InVars {~t~0=v_~t~0_40} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 05:19:22,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [313] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_32) (= v_~t~0_31 (+ v_~t~0_32 1))) InVars {~t~0=v_~t~0_32} OutVars{thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3#1, ~m2~0, ~t~0] and [319] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_7 v_~t~0_44) (= (+ v_~t~0_44 1) v_~t~0_43)) InVars {~t~0=v_~t~0_44} OutVars{~m3~0=v_~m3~0_7, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_1|, ~t~0=v_~t~0_43} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] [2022-12-06 05:19:22,870 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:19:22,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 05:19:22,877 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 279 flow [2022-12-06 05:19:22,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:22,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:22,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:19:22,878 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1435836436, now seen corresponding path program 1 times [2022-12-06 05:19:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:22,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533240124] [2022-12-06 05:19:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533240124] [2022-12-06 05:19:23,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533240124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:23,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:23,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:19:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006543455] [2022-12-06 05:19:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:19:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:19:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:19:23,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:19:23,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:23,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:19:23,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:23,138 INFO L130 PetriNetUnfolder]: 139/290 cut-off events. [2022-12-06 05:19:23,139 INFO L131 PetriNetUnfolder]: For 573/573 co-relation queries the response was YES. [2022-12-06 05:19:23,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 290 events. 139/290 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1188 event pairs, 12 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 976. Up to 95 conditions per place. [2022-12-06 05:19:23,141 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 39 selfloop transitions, 29 changer transitions 2/70 dead transitions. [2022-12-06 05:19:23,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 563 flow [2022-12-06 05:19:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:19:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:19:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-06 05:19:23,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2022-12-06 05:19:23,142 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 279 flow. Second operand 6 states and 55 transitions. [2022-12-06 05:19:23,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 563 flow [2022-12-06 05:19:23,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 522 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 05:19:23,145 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 430 flow [2022-12-06 05:19:23,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2022-12-06 05:19:23,146 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2022-12-06 05:19:23,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:23,146 INFO L89 Accepts]: Start accepts. Operand has 47 places, 50 transitions, 430 flow [2022-12-06 05:19:23,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:23,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:23,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 50 transitions, 430 flow [2022-12-06 05:19:23,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 50 transitions, 430 flow [2022-12-06 05:19:23,155 INFO L130 PetriNetUnfolder]: 22/91 cut-off events. [2022-12-06 05:19:23,155 INFO L131 PetriNetUnfolder]: For 247/255 co-relation queries the response was YES. [2022-12-06 05:19:23,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 91 events. 22/91 cut-off events. For 247/255 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 342 event pairs, 3 based on Foata normal form. 2/93 useless extension candidates. Maximal degree in co-relation 350. Up to 35 conditions per place. [2022-12-06 05:19:23,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 50 transitions, 430 flow [2022-12-06 05:19:23,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 05:19:23,156 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:23,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:19:23,157 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 430 flow [2022-12-06 05:19:23,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:23,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:23,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:19:23,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash -663528794, now seen corresponding path program 1 times [2022-12-06 05:19:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:23,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346948851] [2022-12-06 05:19:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:23,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346948851] [2022-12-06 05:19:23,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346948851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:23,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:23,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288280145] [2022-12-06 05:19:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:23,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:23,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:23,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:23,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:19:23,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:23,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:19:23,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:23,349 INFO L130 PetriNetUnfolder]: 112/239 cut-off events. [2022-12-06 05:19:23,349 INFO L131 PetriNetUnfolder]: For 573/573 co-relation queries the response was YES. [2022-12-06 05:19:23,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 239 events. 112/239 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 902 event pairs, 12 based on Foata normal form. 6/245 useless extension candidates. Maximal degree in co-relation 757. Up to 223 conditions per place. [2022-12-06 05:19:23,352 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 48 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2022-12-06 05:19:23,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 524 flow [2022-12-06 05:19:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 05:19:23,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 05:19:23,353 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 430 flow. Second operand 4 states and 33 transitions. [2022-12-06 05:19:23,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 524 flow [2022-12-06 05:19:23,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 470 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 05:19:23,358 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 366 flow [2022-12-06 05:19:23,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2022-12-06 05:19:23,359 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2022-12-06 05:19:23,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:23,359 INFO L89 Accepts]: Start accepts. Operand has 47 places, 48 transitions, 366 flow [2022-12-06 05:19:23,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:23,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:23,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 48 transitions, 366 flow [2022-12-06 05:19:23,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 48 transitions, 366 flow [2022-12-06 05:19:23,369 INFO L130 PetriNetUnfolder]: 20/87 cut-off events. [2022-12-06 05:19:23,369 INFO L131 PetriNetUnfolder]: For 185/187 co-relation queries the response was YES. [2022-12-06 05:19:23,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 87 events. 20/87 cut-off events. For 185/187 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 291 event pairs, 3 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 295. Up to 32 conditions per place. [2022-12-06 05:19:23,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 48 transitions, 366 flow [2022-12-06 05:19:23,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 05:19:23,373 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] $Ultimate##0-->L45: Formula: (and (= v_~t~0_109 (+ v_~m1~0_79 1)) (= v_~t~0_111 v_~m2~0_85) (= v_~t~0_109 (+ v_~t~0_111 2))) InVars {~t~0=v_~t~0_111} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_11|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_11|, ~m1~0=v_~m1~0_79, ~m2~0=v_~m2~0_85, ~t~0=v_~t~0_109} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, thread2Thread1of1ForFork2_#t~post3#1, ~m1~0, ~m2~0, ~t~0] and [319] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_7 v_~t~0_44) (= (+ v_~t~0_44 1) v_~t~0_43)) InVars {~t~0=v_~t~0_44} OutVars{~m3~0=v_~m3~0_7, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_1|, ~t~0=v_~t~0_43} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] [2022-12-06 05:19:23,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L67-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= v_~b~0_59 (ite (= (ite (or (= v_~x~0_48 1) (not (= (mod v_~b~0_60 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0) (= (+ v_~s~0_152 1) v_~s~0_151) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (<= v_~m2~0_41 v_~s~0_152) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~b~0=v_~b~0_60, ~m2~0=v_~m2~0_41, ~x~0=v_~x~0_48, ~s~0=v_~s~0_152} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_25|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, ~b~0=v_~b~0_59, ~m2~0=v_~m2~0_41, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|, ~x~0=v_~x~0_48, ~s~0=v_~s~0_151} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~s~0] and [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:19:23,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_71 (+ v_~m1~0_81 1)) (= v_~m1~0_81 (+ v_~t~0_123 1)) (= v_~t~0_123 v_~m2~0_89) (= (+ v_~m1~0_81 2) v_~t~0_121)) InVars {~t~0=v_~t~0_123} OutVars{~m3~0=v_~m3~0_71, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_13|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_15|, ~m1~0=v_~m1~0_81, ~m2~0=v_~m2~0_89, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_11|, ~t~0=v_~t~0_121} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork1_#t~post1#1, thread2Thread1of1ForFork2_#t~post3#1, ~m1~0, ~m2~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [428] L67-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|) (= |v_thread2Thread1of1ForFork2_#res#1.base_33| 0) (= (+ v_~s~0_274 1) v_~s~0_273) (= v_~x~0_115 1) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_116 1)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_35|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29| (ite (<= v_~m1~0_83 v_~s~0_273) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35| (ite (<= v_~m2~0_91 v_~s~0_274) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_33| 0)) InVars {~b~0=v_~b~0_166, ~m1~0=v_~m1~0_83, ~m2~0=v_~m2~0_91, ~x~0=v_~x~0_116, ~s~0=v_~s~0_274} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_49|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_33|, ~b~0=v_~b~0_165, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|, ~m1~0=v_~m1~0_83, ~m2~0=v_~m2~0_91, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_115, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_33|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|, ~s~0=v_~s~0_273} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread2Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 05:19:23,672 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:19:23,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 05:19:23,673 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 368 flow [2022-12-06 05:19:23,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:23,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:23,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:19:23,673 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash 103833362, now seen corresponding path program 1 times [2022-12-06 05:19:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:23,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610133975] [2022-12-06 05:19:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:23,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:23,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610133975] [2022-12-06 05:19:23,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610133975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:23,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:23,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008337955] [2022-12-06 05:19:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:23,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:23,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:23,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:19:23,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:23,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:19:23,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:23,858 INFO L130 PetriNetUnfolder]: 108/233 cut-off events. [2022-12-06 05:19:23,858 INFO L131 PetriNetUnfolder]: For 542/542 co-relation queries the response was YES. [2022-12-06 05:19:23,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 233 events. 108/233 cut-off events. For 542/542 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 890 event pairs, 15 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 516. Up to 205 conditions per place. [2022-12-06 05:19:23,861 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 43 selfloop transitions, 6 changer transitions 5/54 dead transitions. [2022-12-06 05:19:23,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 503 flow [2022-12-06 05:19:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 05:19:23,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 05:19:23,862 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 368 flow. Second operand 4 states and 33 transitions. [2022-12-06 05:19:23,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 503 flow [2022-12-06 05:19:23,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 486 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:19:23,866 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 347 flow [2022-12-06 05:19:23,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-06 05:19:23,867 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-06 05:19:23,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:23,867 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 347 flow [2022-12-06 05:19:23,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:23,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:23,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 347 flow [2022-12-06 05:19:23,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 347 flow [2022-12-06 05:19:23,878 INFO L130 PetriNetUnfolder]: 19/82 cut-off events. [2022-12-06 05:19:23,878 INFO L131 PetriNetUnfolder]: For 179/181 co-relation queries the response was YES. [2022-12-06 05:19:23,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 82 events. 19/82 cut-off events. For 179/181 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 266 event pairs, 3 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 286. Up to 31 conditions per place. [2022-12-06 05:19:23,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 347 flow [2022-12-06 05:19:23,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 05:19:23,880 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:23,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:19:23,880 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 347 flow [2022-12-06 05:19:23,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:23,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:23,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:19:23,881 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1108561406, now seen corresponding path program 2 times [2022-12-06 05:19:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:23,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228523679] [2022-12-06 05:19:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:23,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:23,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228523679] [2022-12-06 05:19:23,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228523679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:23,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:23,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:19:23,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196807491] [2022-12-06 05:19:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:23,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:19:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:19:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:19:23,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:19:23,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:23,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:19:23,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:24,067 INFO L130 PetriNetUnfolder]: 56/139 cut-off events. [2022-12-06 05:19:24,067 INFO L131 PetriNetUnfolder]: For 316/316 co-relation queries the response was YES. [2022-12-06 05:19:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 139 events. 56/139 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 7 based on Foata normal form. 10/149 useless extension candidates. Maximal degree in co-relation 460. Up to 47 conditions per place. [2022-12-06 05:19:24,069 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 21 selfloop transitions, 19 changer transitions 2/42 dead transitions. [2022-12-06 05:19:24,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 376 flow [2022-12-06 05:19:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:19:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:19:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 05:19:24,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 05:19:24,070 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 347 flow. Second operand 6 states and 36 transitions. [2022-12-06 05:19:24,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 376 flow [2022-12-06 05:19:24,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 306 flow, removed 6 selfloop flow, removed 11 redundant places. [2022-12-06 05:19:24,073 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 234 flow [2022-12-06 05:19:24,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-06 05:19:24,073 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 05:19:24,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:24,073 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 234 flow [2022-12-06 05:19:24,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:24,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:24,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 234 flow [2022-12-06 05:19:24,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 234 flow [2022-12-06 05:19:24,080 INFO L130 PetriNetUnfolder]: 8/51 cut-off events. [2022-12-06 05:19:24,080 INFO L131 PetriNetUnfolder]: For 121/122 co-relation queries the response was YES. [2022-12-06 05:19:24,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 51 events. 8/51 cut-off events. For 121/122 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 1 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 164. Up to 18 conditions per place. [2022-12-06 05:19:24,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 234 flow [2022-12-06 05:19:24,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 05:19:24,081 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_69 (+ v_~t~0_117 1)) (= v_~t~0_117 v_~m2~0_87) (= v_~t~0_115 (+ v_~t~0_117 2))) InVars {~t~0=v_~t~0_117} OutVars{~m3~0=v_~m3~0_69, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_13|, ~m2~0=v_~m2~0_87, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_9|, ~t~0=v_~t~0_115} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork2_#t~post3#1, ~m2~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [395] L67-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= v_~b~0_59 (ite (= (ite (or (= v_~x~0_48 1) (not (= (mod v_~b~0_60 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0) (= (+ v_~s~0_152 1) v_~s~0_151) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (<= v_~m2~0_41 v_~s~0_152) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~b~0=v_~b~0_60, ~m2~0=v_~m2~0_41, ~x~0=v_~x~0_48, ~s~0=v_~s~0_152} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_25|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, ~b~0=v_~b~0_59, ~m2~0=v_~m2~0_41, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|, ~x~0=v_~x~0_48, ~s~0=v_~s~0_151} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~s~0] [2022-12-06 05:19:24,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [400] L86-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= v_~b~0_93 (ite (= (ite (or (= v_~x~0_64 1) (not (= (mod v_~b~0_94 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| (ite (<= v_~m3~0_41 v_~s~0_188) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= (+ v_~s~0_188 1) v_~s~0_187) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|)) InVars {~m3~0=v_~m3~0_41, ~b~0=v_~b~0_94, ~x~0=v_~x~0_64, ~s~0=v_~s~0_188} OutVars{~m3~0=v_~m3~0_41, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~b~0=v_~b~0_93, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_23|, ~x~0=v_~x~0_64, ~s~0=v_~s~0_187} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post6#1, ~s~0] [2022-12-06 05:19:24,223 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [400] L86-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= v_~b~0_93 (ite (= (ite (or (= v_~x~0_64 1) (not (= (mod v_~b~0_94 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| (ite (<= v_~m3~0_41 v_~s~0_188) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= (+ v_~s~0_188 1) v_~s~0_187) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|)) InVars {~m3~0=v_~m3~0_41, ~b~0=v_~b~0_94, ~x~0=v_~x~0_64, ~s~0=v_~s~0_188} OutVars{~m3~0=v_~m3~0_41, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~b~0=v_~b~0_93, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_23|, ~x~0=v_~x~0_64, ~s~0=v_~s~0_187} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post6#1, ~s~0] [2022-12-06 05:19:24,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [395] L67-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= v_~b~0_59 (ite (= (ite (or (= v_~x~0_48 1) (not (= (mod v_~b~0_60 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0) (= (+ v_~s~0_152 1) v_~s~0_151) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (<= v_~m2~0_41 v_~s~0_152) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~b~0=v_~b~0_60, ~m2~0=v_~m2~0_41, ~x~0=v_~x~0_48, ~s~0=v_~s~0_152} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_25|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, ~b~0=v_~b~0_59, ~m2~0=v_~m2~0_41, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|, ~x~0=v_~x~0_48, ~s~0=v_~s~0_151} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~s~0] [2022-12-06 05:19:24,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [395] L67-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= v_~b~0_59 (ite (= (ite (or (= v_~x~0_48 1) (not (= (mod v_~b~0_60 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0) (= (+ v_~s~0_152 1) v_~s~0_151) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (<= v_~m2~0_41 v_~s~0_152) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~b~0=v_~b~0_60, ~m2~0=v_~m2~0_41, ~x~0=v_~x~0_48, ~s~0=v_~s~0_152} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_25|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, ~b~0=v_~b~0_59, ~m2~0=v_~m2~0_41, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|, ~x~0=v_~x~0_48, ~s~0=v_~s~0_151} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~s~0] [2022-12-06 05:19:24,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [400] L86-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= v_~b~0_93 (ite (= (ite (or (= v_~x~0_64 1) (not (= (mod v_~b~0_94 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| (ite (<= v_~m3~0_41 v_~s~0_188) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= (+ v_~s~0_188 1) v_~s~0_187) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|)) InVars {~m3~0=v_~m3~0_41, ~b~0=v_~b~0_94, ~x~0=v_~x~0_64, ~s~0=v_~s~0_188} OutVars{~m3~0=v_~m3~0_41, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~b~0=v_~b~0_93, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_23|, ~x~0=v_~x~0_64, ~s~0=v_~s~0_187} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post6#1, ~s~0] [2022-12-06 05:19:24,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (<= v_~m1~0_27 v_~s~0_71) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= v_~x~0_14 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_71} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_14, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~s~0=v_~s~0_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [400] L86-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= v_~b~0_93 (ite (= (ite (or (= v_~x~0_64 1) (not (= (mod v_~b~0_94 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| (ite (<= v_~m3~0_41 v_~s~0_188) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= (+ v_~s~0_188 1) v_~s~0_187) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|)) InVars {~m3~0=v_~m3~0_41, ~b~0=v_~b~0_94, ~x~0=v_~x~0_64, ~s~0=v_~s~0_188} OutVars{~m3~0=v_~m3~0_41, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~b~0=v_~b~0_93, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_23|, ~x~0=v_~x~0_64, ~s~0=v_~s~0_187} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post6#1, ~s~0] [2022-12-06 05:19:24,542 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [306] $Ultimate##0-->L45: Formula: (and (= v_~t~0_39 (+ v_~t~0_40 1)) (= v_~m1~0_9 v_~t~0_40)) InVars {~t~0=v_~t~0_40} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [395] L67-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= v_~b~0_59 (ite (= (ite (or (= v_~x~0_48 1) (not (= (mod v_~b~0_60 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0) (= (+ v_~s~0_152 1) v_~s~0_151) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (<= v_~m2~0_41 v_~s~0_152) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~b~0=v_~b~0_60, ~m2~0=v_~m2~0_41, ~x~0=v_~x~0_48, ~s~0=v_~s~0_152} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_25|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, ~b~0=v_~b~0_59, ~m2~0=v_~m2~0_41, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|, ~x~0=v_~x~0_48, ~s~0=v_~s~0_151} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~s~0] [2022-12-06 05:19:24,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_69 (+ v_~t~0_117 1)) (= v_~t~0_117 v_~m2~0_87) (= v_~t~0_115 (+ v_~t~0_117 2))) InVars {~t~0=v_~t~0_117} OutVars{~m3~0=v_~m3~0_69, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_13|, ~m2~0=v_~m2~0_87, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_9|, ~t~0=v_~t~0_115} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork2_#t~post3#1, ~m2~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [437] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_43| 0) (= v_~b~0_201 (ite (= (ite (or (= v_~x~0_137 1) (not (= (mod v_~b~0_202 256) 0))) 1 0) 0) 0 1)) (= (+ v_~s~0_310 1) v_~s~0_309) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_43| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|) (= (ite (<= v_~m2~0_101 v_~s~0_310) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (= v_~t~0_136 v_~m1~0_99) (= v_~t~0_135 (+ v_~t~0_136 1))) InVars {~b~0=v_~b~0_202, ~m2~0=v_~m2~0_101, ~x~0=v_~x~0_137, ~s~0=v_~s~0_310, ~t~0=v_~t~0_136} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_59|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_17|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_43|, ~b~0=v_~b~0_201, ~m2~0=v_~m2~0_101, ~m1~0=v_~m1~0_99, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_43|, ~x~0=v_~x~0_137, ~s~0=v_~s~0_309, ~t~0=v_~t~0_135} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post1#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, ~m1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~s~0, ~t~0] [2022-12-06 05:19:24,669 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:19:24,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 597 [2022-12-06 05:19:24,670 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 275 flow [2022-12-06 05:19:24,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:24,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:24,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:24,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:19:24,671 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash -790842084, now seen corresponding path program 1 times [2022-12-06 05:19:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:24,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668042862] [2022-12-06 05:19:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:24,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:24,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668042862] [2022-12-06 05:19:24,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668042862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:24,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:24,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453583003] [2022-12-06 05:19:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:24,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:24,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:24,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:19:24,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:24,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:24,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:19:24,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:24,831 INFO L130 PetriNetUnfolder]: 48/121 cut-off events. [2022-12-06 05:19:24,832 INFO L131 PetriNetUnfolder]: For 332/332 co-relation queries the response was YES. [2022-12-06 05:19:24,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 121 events. 48/121 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 431 event pairs, 6 based on Foata normal form. 4/125 useless extension candidates. Maximal degree in co-relation 335. Up to 112 conditions per place. [2022-12-06 05:19:24,832 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 28 selfloop transitions, 3 changer transitions 4/35 dead transitions. [2022-12-06 05:19:24,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 333 flow [2022-12-06 05:19:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 05:19:24,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2022-12-06 05:19:24,834 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 275 flow. Second operand 4 states and 32 transitions. [2022-12-06 05:19:24,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 333 flow [2022-12-06 05:19:24,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 286 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:19:24,835 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 193 flow [2022-12-06 05:19:24,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-06 05:19:24,836 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 05:19:24,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:24,836 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 193 flow [2022-12-06 05:19:24,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:24,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:24,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 193 flow [2022-12-06 05:19:24,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 193 flow [2022-12-06 05:19:24,840 INFO L130 PetriNetUnfolder]: 7/40 cut-off events. [2022-12-06 05:19:24,840 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-06 05:19:24,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 40 events. 7/40 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 2 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 119. Up to 16 conditions per place. [2022-12-06 05:19:24,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 193 flow [2022-12-06 05:19:24,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 05:19:24,841 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:24,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 05:19:24,841 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 193 flow [2022-12-06 05:19:24,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:24,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:24,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:24,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:19:24,842 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2048855267, now seen corresponding path program 1 times [2022-12-06 05:19:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:24,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99417760] [2022-12-06 05:19:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:24,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99417760] [2022-12-06 05:19:24,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99417760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:24,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:24,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617495881] [2022-12-06 05:19:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:24,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:19:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:19:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:19:24,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:19:24,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:24,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:24,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:19:24,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:24,987 INFO L130 PetriNetUnfolder]: 32/85 cut-off events. [2022-12-06 05:19:24,987 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-06 05:19:24,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 85 events. 32/85 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 231 event pairs, 0 based on Foata normal form. 2/87 useless extension candidates. Maximal degree in co-relation 312. Up to 59 conditions per place. [2022-12-06 05:19:24,987 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 26 selfloop transitions, 7 changer transitions 3/36 dead transitions. [2022-12-06 05:19:24,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 285 flow [2022-12-06 05:19:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:19:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:19:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-06 05:19:24,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.264 [2022-12-06 05:19:24,988 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 193 flow. Second operand 5 states and 33 transitions. [2022-12-06 05:19:24,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 285 flow [2022-12-06 05:19:24,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 242 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-06 05:19:24,990 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 151 flow [2022-12-06 05:19:24,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-06 05:19:24,990 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 05:19:24,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:24,990 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 151 flow [2022-12-06 05:19:24,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:24,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:24,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 151 flow [2022-12-06 05:19:24,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 151 flow [2022-12-06 05:19:24,994 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 05:19:24,994 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 05:19:24,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 36 events. 6/36 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 2 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 88. Up to 14 conditions per place. [2022-12-06 05:19:24,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 151 flow [2022-12-06 05:19:24,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 30 [2022-12-06 05:19:24,994 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:24,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 05:19:24,995 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 151 flow [2022-12-06 05:19:24,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:24,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:24,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:24,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:19:24,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1907926220, now seen corresponding path program 1 times [2022-12-06 05:19:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:24,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507609750] [2022-12-06 05:19:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507609750] [2022-12-06 05:19:25,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507609750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:25,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:25,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:19:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904320597] [2022-12-06 05:19:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:25,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:19:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:19:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:19:25,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:19:25,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:25,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:25,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:19:25,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:25,191 INFO L130 PetriNetUnfolder]: 27/78 cut-off events. [2022-12-06 05:19:25,192 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 05:19:25,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 78 events. 27/78 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 221 event pairs, 0 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 110. Up to 34 conditions per place. [2022-12-06 05:19:25,192 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 24 selfloop transitions, 11 changer transitions 5/40 dead transitions. [2022-12-06 05:19:25,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 286 flow [2022-12-06 05:19:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:19:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:19:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-12-06 05:19:25,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21739130434782608 [2022-12-06 05:19:25,193 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 151 flow. Second operand 8 states and 40 transitions. [2022-12-06 05:19:25,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 286 flow [2022-12-06 05:19:25,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 250 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-06 05:19:25,194 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 169 flow [2022-12-06 05:19:25,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=169, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-06 05:19:25,195 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 05:19:25,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:25,195 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 169 flow [2022-12-06 05:19:25,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:25,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:25,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 169 flow [2022-12-06 05:19:25,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 169 flow [2022-12-06 05:19:25,198 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-06 05:19:25,198 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 05:19:25,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 32 events. 4/32 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 88. Up to 12 conditions per place. [2022-12-06 05:19:25,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 169 flow [2022-12-06 05:19:25,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 05:19:25,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_7 v_~t~0_44) (= (+ v_~t~0_44 1) v_~t~0_43)) InVars {~t~0=v_~t~0_44} OutVars{~m3~0=v_~m3~0_7, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_1|, ~t~0=v_~t~0_43} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [306] $Ultimate##0-->L45: Formula: (and (= v_~t~0_39 (+ v_~t~0_40 1)) (= v_~m1~0_9 v_~t~0_40)) InVars {~t~0=v_~t~0_40} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 05:19:25,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_7 v_~t~0_44) (= (+ v_~t~0_44 1) v_~t~0_43)) InVars {~t~0=v_~t~0_44} OutVars{~m3~0=v_~m3~0_7, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_1|, ~t~0=v_~t~0_43} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [313] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_32) (= v_~t~0_31 (+ v_~t~0_32 1))) InVars {~t~0=v_~t~0_32} OutVars{thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 05:19:25,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] $Ultimate##0-->L67: Formula: (and (= (+ v_~t~0_157 2) v_~t~0_155) (= v_~t~0_157 v_~m3~0_91) (= v_~m2~0_105 (+ v_~t~0_157 1))) InVars {~t~0=v_~t~0_157} OutVars{~m3~0=v_~m3~0_91, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_23|, ~m2~0=v_~m2~0_105, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_23|, ~t~0=v_~t~0_155} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork2_#t~post3#1, ~m2~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [306] $Ultimate##0-->L45: Formula: (and (= v_~t~0_39 (+ v_~t~0_40 1)) (= v_~m1~0_9 v_~t~0_40)) InVars {~t~0=v_~t~0_40} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 05:19:25,311 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:19:25,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 05:19:25,312 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 155 flow [2022-12-06 05:19:25,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:25,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:25,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:25,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:19:25,312 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:25,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1436873743, now seen corresponding path program 1 times [2022-12-06 05:19:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:25,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149433628] [2022-12-06 05:19:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:25,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:25,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:25,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149433628] [2022-12-06 05:19:25,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149433628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:25,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:25,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:19:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450716451] [2022-12-06 05:19:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:25,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:19:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:19:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:19:25,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:19:25,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:25,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:25,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:19:25,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:25,475 INFO L130 PetriNetUnfolder]: 18/59 cut-off events. [2022-12-06 05:19:25,476 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 05:19:25,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 59 events. 18/59 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 146 event pairs, 1 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 210. Up to 38 conditions per place. [2022-12-06 05:19:25,476 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 23 selfloop transitions, 6 changer transitions 5/34 dead transitions. [2022-12-06 05:19:25,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 244 flow [2022-12-06 05:19:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:19:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:19:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-12-06 05:19:25,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20238095238095238 [2022-12-06 05:19:25,477 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 155 flow. Second operand 7 states and 34 transitions. [2022-12-06 05:19:25,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 244 flow [2022-12-06 05:19:25,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 201 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-06 05:19:25,478 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 131 flow [2022-12-06 05:19:25,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-06 05:19:25,480 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-06 05:19:25,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:25,480 INFO L89 Accepts]: Start accepts. Operand has 38 places, 26 transitions, 131 flow [2022-12-06 05:19:25,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:25,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:25,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 131 flow [2022-12-06 05:19:25,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 131 flow [2022-12-06 05:19:25,483 INFO L130 PetriNetUnfolder]: 2/26 cut-off events. [2022-12-06 05:19:25,483 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 05:19:25,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 26 events. 2/26 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 53. Up to 6 conditions per place. [2022-12-06 05:19:25,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 131 flow [2022-12-06 05:19:25,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-06 05:19:25,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_163 2) v_~m1~0_105) (= v_~t~0_163 v_~m3~0_93) (= v_~m2~0_107 (+ v_~t~0_163 1)) (= v_~t~0_161 (+ v_~t~0_163 3))) InVars {~t~0=v_~t~0_163} OutVars{~m3~0=v_~m3~0_93, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_25|, ~m1~0=v_~m1~0_105, ~m2~0=v_~m2~0_107, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_25|, ~t~0=v_~t~0_161} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork1_#t~post1#1, thread2Thread1of1ForFork2_#t~post3#1, ~m1~0, ~m2~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [400] L86-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= v_~b~0_93 (ite (= (ite (or (= v_~x~0_64 1) (not (= (mod v_~b~0_94 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| (ite (<= v_~m3~0_41 v_~s~0_188) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= (+ v_~s~0_188 1) v_~s~0_187) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|)) InVars {~m3~0=v_~m3~0_41, ~b~0=v_~b~0_94, ~x~0=v_~x~0_64, ~s~0=v_~s~0_188} OutVars{~m3~0=v_~m3~0_41, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~b~0=v_~b~0_93, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_23|, ~x~0=v_~x~0_64, ~s~0=v_~s~0_187} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post6#1, ~s~0] [2022-12-06 05:19:25,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] $Ultimate##0-->L45: Formula: (and (= v_~t~0_147 v_~m3~0_87) (= v_~t~0_145 (+ v_~t~0_147 2)) (= (+ v_~t~0_147 1) v_~m1~0_103)) InVars {~t~0=v_~t~0_147} OutVars{~m3~0=v_~m3~0_87, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_21|, ~m1~0=v_~m1~0_103, thread3Thread1of1ForFork0_#t~post5#1=|v_thread3Thread1of1ForFork0_#t~post5#1_19|, ~t~0=v_~t~0_145} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, thread3Thread1of1ForFork0_#t~post5#1, ~t~0] and [400] L86-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= v_~b~0_93 (ite (= (ite (or (= v_~x~0_64 1) (not (= (mod v_~b~0_94 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| (ite (<= v_~m3~0_41 v_~s~0_188) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= (+ v_~s~0_188 1) v_~s~0_187) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|)) InVars {~m3~0=v_~m3~0_41, ~b~0=v_~b~0_94, ~x~0=v_~x~0_64, ~s~0=v_~s~0_188} OutVars{~m3~0=v_~m3~0_41, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~b~0=v_~b~0_93, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_23|, ~x~0=v_~x~0_64, ~s~0=v_~s~0_187} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post6#1, ~s~0] [2022-12-06 05:19:25,612 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:19:25,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 05:19:25,613 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 123 flow [2022-12-06 05:19:25,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:25,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:25,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:25,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:19:25,613 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:25,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:25,613 INFO L85 PathProgramCache]: Analyzing trace with hash -304716098, now seen corresponding path program 1 times [2022-12-06 05:19:25,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:25,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829051273] [2022-12-06 05:19:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:25,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:25,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829051273] [2022-12-06 05:19:25,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829051273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:25,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:25,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240312065] [2022-12-06 05:19:25,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:25,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:25,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:25,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:25,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:19:25,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:25,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:25,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:19:25,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:25,728 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2022-12-06 05:19:25,728 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-06 05:19:25,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 39 events. 10/39 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 140. Up to 30 conditions per place. [2022-12-06 05:19:25,728 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 19 selfloop transitions, 3 changer transitions 2/24 dead transitions. [2022-12-06 05:19:25,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 161 flow [2022-12-06 05:19:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-12-06 05:19:25,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27380952380952384 [2022-12-06 05:19:25,729 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 123 flow. Second operand 4 states and 23 transitions. [2022-12-06 05:19:25,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 161 flow [2022-12-06 05:19:25,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 142 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 05:19:25,730 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 86 flow [2022-12-06 05:19:25,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 05:19:25,731 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 05:19:25,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:25,731 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 86 flow [2022-12-06 05:19:25,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:25,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:25,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 86 flow [2022-12-06 05:19:25,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 86 flow [2022-12-06 05:19:25,734 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2022-12-06 05:19:25,734 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 05:19:25,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 21 events. 1/21 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 26. Up to 5 conditions per place. [2022-12-06 05:19:25,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 86 flow [2022-12-06 05:19:25,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 05:19:25,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_129 1))) (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= (ite (<= v_~m1~0_91 v_~s~0_294) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|) (= v_~s~0_293 (+ v_~s~0_294 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_97 v_~s~0_294) 1 0)) .cse0 (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_186 256) 0))) 1 0) 0) 0 1) v_~b~0_185))) InVars {~b~0=v_~b~0_186, ~m2~0=v_~m2~0_97, ~m1~0=v_~m1~0_91, ~s~0=v_~s~0_294} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_55|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~b~0=v_~b~0_185, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|, ~m2~0=v_~m2~0_97, ~m1~0=v_~m1~0_91, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~x~0=v_~x~0_129, ~s~0=v_~s~0_293, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [414] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_21| 0) (= v_~s~0_225 (+ v_~s~0_226 1)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_21| 0) (= v_~x~0_87 0)) InVars {~s~0=v_~s~0_226} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_23|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_21|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_21|, ~x~0=v_~x~0_87, ~s~0=v_~s~0_225} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:19:25,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_129 1))) (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= (ite (<= v_~m1~0_91 v_~s~0_294) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|) (= v_~s~0_293 (+ v_~s~0_294 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_97 v_~s~0_294) 1 0)) .cse0 (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_186 256) 0))) 1 0) 0) 0 1) v_~b~0_185))) InVars {~b~0=v_~b~0_186, ~m2~0=v_~m2~0_97, ~m1~0=v_~m1~0_91, ~s~0=v_~s~0_294} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_55|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~b~0=v_~b~0_185, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|, ~m2~0=v_~m2~0_97, ~m1~0=v_~m1~0_91, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~x~0=v_~x~0_129, ~s~0=v_~s~0_293, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [414] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_21| 0) (= v_~s~0_225 (+ v_~s~0_226 1)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_21| 0) (= v_~x~0_87 0)) InVars {~s~0=v_~s~0_226} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_23|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_21|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_21|, ~x~0=v_~x~0_87, ~s~0=v_~s~0_225} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:19:25,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:25,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:19:25,901 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 82 flow [2022-12-06 05:19:25,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:25,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:25,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:25,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:19:25,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:19:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash -796013257, now seen corresponding path program 1 times [2022-12-06 05:19:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:25,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073685690] [2022-12-06 05:19:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:25,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:25,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073685690] [2022-12-06 05:19:25,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073685690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:25,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:25,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44149427] [2022-12-06 05:19:25,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:25,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:19:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:19:25,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:19:25,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:19:25,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:25,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:25,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:19:25,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:26,030 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 05:19:26,030 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 05:19:26,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 22 events. 5/22 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 1 based on Foata normal form. 4/26 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2022-12-06 05:19:26,030 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2022-12-06 05:19:26,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 14 transitions, 87 flow [2022-12-06 05:19:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:19:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:19:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-12-06 05:19:26,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15789473684210525 [2022-12-06 05:19:26,031 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 82 flow. Second operand 5 states and 15 transitions. [2022-12-06 05:19:26,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 14 transitions, 87 flow [2022-12-06 05:19:26,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 14 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:26,031 INFO L231 Difference]: Finished difference. Result has 22 places, 0 transitions, 0 flow [2022-12-06 05:19:26,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=22, PETRI_TRANSITIONS=0} [2022-12-06 05:19:26,032 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -8 predicate places. [2022-12-06 05:19:26,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:26,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 0 transitions, 0 flow [2022-12-06 05:19:26,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:19:26,032 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:19:26,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:19:26,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:19:26,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:19:26,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:19:26,033 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:26,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 05:19:26,033 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:19:26,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:26,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:19:26,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:19:26,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:19:26,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:19:26,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:19:26,036 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:26,038 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:19:26,038 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:19:26,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:19:26 BasicIcfg [2022-12-06 05:19:26,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:19:26,040 INFO L158 Benchmark]: Toolchain (without parser) took 10774.34ms. Allocated memory was 179.3MB in the beginning and 330.3MB in the end (delta: 151.0MB). Free memory was 156.3MB in the beginning and 129.6MB in the end (delta: 26.7MB). Peak memory consumption was 179.2MB. Max. memory is 8.0GB. [2022-12-06 05:19:26,040 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:19:26,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.10ms. Allocated memory is still 179.3MB. Free memory was 156.3MB in the beginning and 142.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:19:26,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.43ms. Allocated memory is still 179.3MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:19:26,041 INFO L158 Benchmark]: Boogie Preprocessor took 30.35ms. Allocated memory is still 179.3MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:19:26,041 INFO L158 Benchmark]: RCFGBuilder took 500.14ms. Allocated memory is still 179.3MB. Free memory was 139.0MB in the beginning and 120.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 05:19:26,041 INFO L158 Benchmark]: TraceAbstraction took 9937.99ms. Allocated memory was 179.3MB in the beginning and 330.3MB in the end (delta: 151.0MB). Free memory was 119.1MB in the beginning and 129.6MB in the end (delta: -10.6MB). Peak memory consumption was 141.4MB. Max. memory is 8.0GB. [2022-12-06 05:19:26,042 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.10ms. Allocated memory is still 179.3MB. Free memory was 156.3MB in the beginning and 142.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.43ms. Allocated memory is still 179.3MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.35ms. Allocated memory is still 179.3MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 500.14ms. Allocated memory is still 179.3MB. Free memory was 139.0MB in the beginning and 120.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9937.99ms. Allocated memory was 179.3MB in the beginning and 330.3MB in the end (delta: 151.0MB). Free memory was 119.1MB in the beginning and 129.6MB in the end (delta: -10.6MB). Peak memory consumption was 141.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 107 PlacesBefore, 30 PlacesAfterwards, 99 TransitionsBefore, 20 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 53 TrivialYvCompositions, 24 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 371, independent: 349, independent conditional: 349, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 371, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 371, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 371, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 354, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 354, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 371, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 354, unknown conditional: 0, unknown unconditional: 354] , Statistics on independence cache: Total cache size (in pairs): 499, Positive cache size: 483, Positive conditional cache size: 0, Positive unconditional cache size: 483, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 39 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 13, Positive conditional cache size: 4, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 13, Positive conditional cache size: 4, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 47 PlacesBefore, 46 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 17, Positive conditional cache size: 8, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 17, Positive conditional cache size: 8, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 30 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 12, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 26, Positive conditional cache size: 14, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 28, Positive conditional cache size: 16, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 28, Positive conditional cache size: 16, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 124]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1385 IncrementalHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 0 mSDtfsCounter, 1385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=5, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:19:26,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...