/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:16:05,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:16:05,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:16:05,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:16:05,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:16:05,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:16:05,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:16:05,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:16:05,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:16:05,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:16:05,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:16:05,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:16:05,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:16:05,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:16:05,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:16:05,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:16:05,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:16:05,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:16:05,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:16:05,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:16:05,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:16:05,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:16:05,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:16:05,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:16:05,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:16:05,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:16:05,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:16:05,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:16:05,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:16:05,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:16:05,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:16:05,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:16:05,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:16:05,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:16:05,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:16:05,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:16:05,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:16:05,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:16:05,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:16:05,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:16:05,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:16:05,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:16:05,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:16:05,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:16:05,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:16:05,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:16:05,308 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:16:05,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:16:05,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:16:05,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:16:05,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:16:05,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:16:05,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:16:05,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:16:05,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:16:05,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:16:05,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:16:05,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:16:05,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:16:05,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:16:05,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:16:05,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:16:05,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:16:05,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:16:05,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:16:05,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:16:05,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:16:05,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:16:05,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:16:05,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:16:05,313 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-05 23:16:05,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:16:05,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:16:05,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:16:05,653 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:16:05,653 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:16:05,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:16:06,809 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:16:07,040 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:16:07,041 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:16:07,053 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09425e7b/36a2d2fb04484dfba851998ff2b730d8/FLAG5306c3b34 [2022-12-05 23:16:07,070 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09425e7b/36a2d2fb04484dfba851998ff2b730d8 [2022-12-05 23:16:07,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:16:07,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:16:07,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:16:07,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:16:07,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:16:07,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a653765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07, skipping insertion in model container [2022-12-05 23:16:07,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:16:07,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:16:07,234 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:16:07,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:16:07,398 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:16:07,413 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:16:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:16:07,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:16:07,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:16:07,497 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:16:07,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07 WrapperNode [2022-12-05 23:16:07,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:16:07,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:16:07,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:16:07,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:16:07,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,541 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-05 23:16:07,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:16:07,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:16:07,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:16:07,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:16:07,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:16:07,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:16:07,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:16:07,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:16:07,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (1/1) ... [2022-12-05 23:16:07,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:16:07,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:16:07,617 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-05 23:16:07,633 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-05 23:16:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:16:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:16:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:16:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:16:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:16:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:16:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:16:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:16:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:16:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:16:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:16:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:16:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:16:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:16:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:16:07,663 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:16:07,851 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:16:07,853 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:16:08,040 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:16:08,047 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:16:08,047 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:16:08,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:16:08 BoogieIcfgContainer [2022-12-05 23:16:08,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:16:08,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:16:08,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:16:08,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:16:08,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:16:07" (1/3) ... [2022-12-05 23:16:08,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d46253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:16:08, skipping insertion in model container [2022-12-05 23:16:08,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:16:07" (2/3) ... [2022-12-05 23:16:08,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d46253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:16:08, skipping insertion in model container [2022-12-05 23:16:08,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:16:08" (3/3) ... [2022-12-05 23:16:08,063 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:16:08,078 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:16:08,079 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:16:08,079 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:16:08,160 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:16:08,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 84 transitions, 183 flow [2022-12-05 23:16:08,256 INFO L130 PetriNetUnfolder]: 2/81 cut-off events. [2022-12-05 23:16:08,256 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:16:08,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-05 23:16:08,261 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 84 transitions, 183 flow [2022-12-05 23:16:08,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 69 transitions, 147 flow [2022-12-05 23:16:08,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:08,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-05 23:16:08,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 147 flow [2022-12-05 23:16:08,327 INFO L130 PetriNetUnfolder]: 1/69 cut-off events. [2022-12-05 23:16:08,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:16:08,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 34 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:16:08,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-05 23:16:08,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-05 23:16:10,505 INFO L203 LiptonReduction]: Total number of compositions: 53 [2022-12-05 23:16:10,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:16:10,524 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;@1c747482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:16:10,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 23:16:10,528 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-05 23:16:10,528 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:16:10,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:10,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:10,529 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-05 23:16:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash -992694487, now seen corresponding path program 1 times [2022-12-05 23:16:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:10,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112407500] [2022-12-05 23:16:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:10,942 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-05 23:16:10,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:10,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112407500] [2022-12-05 23:16:10,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112407500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:10,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:10,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:16:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698526686] [2022-12-05 23:16:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:10,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:16:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:10,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:16:10,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:16:10,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:16:10,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 23:16:10,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:10,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:16:10,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:11,100 INFO L130 PetriNetUnfolder]: 222/384 cut-off events. [2022-12-05 23:16:11,101 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:16:11,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 384 events. 222/384 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1502 event pairs, 69 based on Foata normal form. 3/387 useless extension candidates. Maximal degree in co-relation 772. Up to 340 conditions per place. [2022-12-05 23:16:11,108 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 21 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2022-12-05 23:16:11,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 113 flow [2022-12-05 23:16:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:16:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:16:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 23:16:11,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-05 23:16:11,120 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 43 flow. Second operand 3 states and 30 transitions. [2022-12-05 23:16:11,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 113 flow [2022-12-05 23:16:11,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:16:11,124 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 57 flow [2022-12-05 23:16:11,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-05 23:16:11,131 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2022-12-05 23:16:11,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:11,132 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 57 flow [2022-12-05 23:16:11,134 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:11,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:11,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 57 flow [2022-12-05 23:16:11,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 57 flow [2022-12-05 23:16:11,151 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-05 23:16:11,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:16:11,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 26 events. 3/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 39. Up to 10 conditions per place. [2022-12-05 23:16:11,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 57 flow [2022-12-05 23:16:11,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-05 23:16:11,184 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:16:11,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-05 23:16:11,187 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 57 flow [2022-12-05 23:16:11,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 23:16:11,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:11,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:11,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:16:11,192 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-05 23:16:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash -708758897, now seen corresponding path program 1 times [2022-12-05 23:16:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:11,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496898226] [2022-12-05 23:16:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:11,345 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-05 23:16:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:11,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496898226] [2022-12-05 23:16:11,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496898226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:11,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:11,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:16:11,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078472830] [2022-12-05 23:16:11,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:11,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:16:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:11,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:16:11,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:16:11,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:16:11,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:16:11,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:11,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:16:11,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:11,407 INFO L130 PetriNetUnfolder]: 201/354 cut-off events. [2022-12-05 23:16:11,407 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-05 23:16:11,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 354 events. 201/354 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1295 event pairs, 75 based on Foata normal form. 9/363 useless extension candidates. Maximal degree in co-relation 812. Up to 211 conditions per place. [2022-12-05 23:16:11,413 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 19 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2022-12-05 23:16:11,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 111 flow [2022-12-05 23:16:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:16:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:16:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 23:16:11,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-05 23:16:11,414 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 57 flow. Second operand 3 states and 25 transitions. [2022-12-05 23:16:11,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 111 flow [2022-12-05 23:16:11,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:16:11,416 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 65 flow [2022-12-05 23:16:11,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2022-12-05 23:16:11,417 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-05 23:16:11,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:11,417 INFO L89 Accepts]: Start accepts. Operand has 28 places, 18 transitions, 65 flow [2022-12-05 23:16:11,418 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:11,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:11,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 18 transitions, 65 flow [2022-12-05 23:16:11,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 65 flow [2022-12-05 23:16:11,422 INFO L130 PetriNetUnfolder]: 2/22 cut-off events. [2022-12-05 23:16:11,422 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:16:11,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 37. Up to 8 conditions per place. [2022-12-05 23:16:11,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 18 transitions, 65 flow [2022-12-05 23:16:11,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-05 23:16:11,429 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:16:11,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-05 23:16:11,430 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 65 flow [2022-12-05 23:16:11,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:16:11,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:11,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:11,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:16:11,431 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-05 23:16:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash -708758215, now seen corresponding path program 1 times [2022-12-05 23:16:11,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:11,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566850435] [2022-12-05 23:16:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:11,589 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-05 23:16:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:11,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566850435] [2022-12-05 23:16:11,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566850435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:11,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:11,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:16:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395404776] [2022-12-05 23:16:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:11,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:16:11,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:16:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:16:11,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:16:11,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:16:11,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:11,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:16:11,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:11,703 INFO L130 PetriNetUnfolder]: 256/448 cut-off events. [2022-12-05 23:16:11,704 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-12-05 23:16:11,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 448 events. 256/448 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1908 event pairs, 49 based on Foata normal form. 24/469 useless extension candidates. Maximal degree in co-relation 1057. Up to 233 conditions per place. [2022-12-05 23:16:11,707 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 11 changer transitions 2/46 dead transitions. [2022-12-05 23:16:11,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 46 transitions, 239 flow [2022-12-05 23:16:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:16:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:16:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-05 23:16:11,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-05 23:16:11,708 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 65 flow. Second operand 5 states and 50 transitions. [2022-12-05 23:16:11,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 46 transitions, 239 flow [2022-12-05 23:16:11,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:16:11,710 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 139 flow [2022-12-05 23:16:11,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-05 23:16:11,711 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2022-12-05 23:16:11,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:11,711 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 139 flow [2022-12-05 23:16:11,712 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:11,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:11,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 139 flow [2022-12-05 23:16:11,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 139 flow [2022-12-05 23:16:11,719 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-05 23:16:11,719 INFO L131 PetriNetUnfolder]: For 43/51 co-relation queries the response was YES. [2022-12-05 23:16:11,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 57 events. 10/57 cut-off events. For 43/51 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 207 event pairs, 1 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 145. Up to 19 conditions per place. [2022-12-05 23:16:11,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 139 flow [2022-12-05 23:16:11,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-05 23:16:11,722 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:16:11,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-05 23:16:11,723 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 139 flow [2022-12-05 23:16:11,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:16:11,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:11,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:11,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:16:11,723 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-05 23:16:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -496648194, now seen corresponding path program 1 times [2022-12-05 23:16:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:11,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019661481] [2022-12-05 23:16:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:11,817 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-05 23:16:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:11,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019661481] [2022-12-05 23:16:11,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019661481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:11,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:11,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:16:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586574098] [2022-12-05 23:16:11,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:11,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:16:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:11,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:16:11,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:16:11,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:16:11,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 23:16:11,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:11,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:16:11,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:11,895 INFO L130 PetriNetUnfolder]: 248/439 cut-off events. [2022-12-05 23:16:11,896 INFO L131 PetriNetUnfolder]: For 426/426 co-relation queries the response was YES. [2022-12-05 23:16:11,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 439 events. 248/439 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1889 event pairs, 121 based on Foata normal form. 4/441 useless extension candidates. Maximal degree in co-relation 1318. Up to 357 conditions per place. [2022-12-05 23:16:11,900 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 27 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2022-12-05 23:16:11,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 229 flow [2022-12-05 23:16:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:16:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:16:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-05 23:16:11,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:16:11,902 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 139 flow. Second operand 3 states and 28 transitions. [2022-12-05 23:16:11,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 229 flow [2022-12-05 23:16:11,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:16:11,908 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 159 flow [2022-12-05 23:16:11,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-05 23:16:11,909 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-05 23:16:11,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:11,909 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 159 flow [2022-12-05 23:16:11,911 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:11,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:11,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 159 flow [2022-12-05 23:16:11,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 159 flow [2022-12-05 23:16:11,921 INFO L130 PetriNetUnfolder]: 9/54 cut-off events. [2022-12-05 23:16:11,921 INFO L131 PetriNetUnfolder]: For 66/72 co-relation queries the response was YES. [2022-12-05 23:16:11,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 54 events. 9/54 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 189 event pairs, 1 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 149. Up to 17 conditions per place. [2022-12-05 23:16:11,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 159 flow [2022-12-05 23:16:11,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-05 23:16:11,926 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:16:11,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-05 23:16:11,932 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 159 flow [2022-12-05 23:16:11,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 23:16:11,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:11,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:11,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:16:11,933 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-05 23:16:11,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash -496669057, now seen corresponding path program 1 times [2022-12-05 23:16:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:11,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908893739] [2022-12-05 23:16:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:12,048 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-05 23:16:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:12,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908893739] [2022-12-05 23:16:12,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908893739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:12,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:12,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:16:12,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319115298] [2022-12-05 23:16:12,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:12,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:16:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:12,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:16:12,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:16:12,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:16:12,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-05 23:16:12,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:12,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:16:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:12,140 INFO L130 PetriNetUnfolder]: 263/472 cut-off events. [2022-12-05 23:16:12,140 INFO L131 PetriNetUnfolder]: For 674/674 co-relation queries the response was YES. [2022-12-05 23:16:12,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 472 events. 263/472 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2161 event pairs, 53 based on Foata normal form. 18/488 useless extension candidates. Maximal degree in co-relation 1440. Up to 232 conditions per place. [2022-12-05 23:16:12,143 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 23 selfloop transitions, 5 changer transitions 8/37 dead transitions. [2022-12-05 23:16:12,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 263 flow [2022-12-05 23:16:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:16:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:16:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-05 23:16:12,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-05 23:16:12,145 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 159 flow. Second operand 4 states and 35 transitions. [2022-12-05 23:16:12,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 263 flow [2022-12-05 23:16:12,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:16:12,149 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 124 flow [2022-12-05 23:16:12,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2022-12-05 23:16:12,151 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2022-12-05 23:16:12,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:12,156 INFO L89 Accepts]: Start accepts. Operand has 39 places, 20 transitions, 124 flow [2022-12-05 23:16:12,157 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:12,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:12,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 20 transitions, 124 flow [2022-12-05 23:16:12,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 20 transitions, 124 flow [2022-12-05 23:16:12,161 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-05 23:16:12,162 INFO L131 PetriNetUnfolder]: For 41/48 co-relation queries the response was YES. [2022-12-05 23:16:12,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 26 events. 3/26 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 76. Up to 8 conditions per place. [2022-12-05 23:16:12,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 20 transitions, 124 flow [2022-12-05 23:16:12,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-05 23:16:12,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [251] $Ultimate##0-->L741: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= v_~x~0_40 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_40} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [208] $Ultimate##0-->L726: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_4 v_~y~0_8)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-05 23:16:12,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:16:12,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 23:16:12,214 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 132 flow [2022-12-05 23:16:12,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-05 23:16:12,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:12,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:12,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:16:12,214 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-05 23:16:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1748407900, now seen corresponding path program 1 times [2022-12-05 23:16:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:12,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156813557] [2022-12-05 23:16:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:12,362 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-05 23:16:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:12,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156813557] [2022-12-05 23:16:12,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156813557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:12,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:12,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:16:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609873500] [2022-12-05 23:16:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:12,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:16:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:12,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:16:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:16:12,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:16:12,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 20 transitions, 132 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-05 23:16:12,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:12,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:16:12,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:12,434 INFO L130 PetriNetUnfolder]: 191/332 cut-off events. [2022-12-05 23:16:12,434 INFO L131 PetriNetUnfolder]: For 1014/1014 co-relation queries the response was YES. [2022-12-05 23:16:12,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 332 events. 191/332 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1060 event pairs, 79 based on Foata normal form. 18/350 useless extension candidates. Maximal degree in co-relation 1092. Up to 160 conditions per place. [2022-12-05 23:16:12,436 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 18 selfloop transitions, 3 changer transitions 9/30 dead transitions. [2022-12-05 23:16:12,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 225 flow [2022-12-05 23:16:12,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:16:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:16:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-05 23:16:12,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-05 23:16:12,437 INFO L175 Difference]: Start difference. First operand has 39 places, 20 transitions, 132 flow. Second operand 4 states and 29 transitions. [2022-12-05 23:16:12,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 225 flow [2022-12-05 23:16:12,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 195 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-05 23:16:12,440 INFO L231 Difference]: Finished difference. Result has 38 places, 16 transitions, 88 flow [2022-12-05 23:16:12,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=16} [2022-12-05 23:16:12,441 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2022-12-05 23:16:12,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:12,441 INFO L89 Accepts]: Start accepts. Operand has 38 places, 16 transitions, 88 flow [2022-12-05 23:16:12,441 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:12,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:12,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 16 transitions, 88 flow [2022-12-05 23:16:12,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 16 transitions, 88 flow [2022-12-05 23:16:12,445 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-05 23:16:12,445 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-05 23:16:12,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 18 events. 1/18 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 1 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 52. Up to 6 conditions per place. [2022-12-05 23:16:12,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 16 transitions, 88 flow [2022-12-05 23:16:12,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-05 23:16:12,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [187] L753-->L756: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [208] $Ultimate##0-->L726: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_4 v_~y~0_8)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-05 23:16:12,502 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:16:12,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-05 23:16:12,503 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 14 transitions, 80 flow [2022-12-05 23:16:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-05 23:16:12,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:12,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:16:12,503 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-05 23:16:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash -305072100, now seen corresponding path program 1 times [2022-12-05 23:16:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:12,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757755498] [2022-12-05 23:16:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:12,575 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-05 23:16:12,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:12,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757755498] [2022-12-05 23:16:12,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757755498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:12,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:12,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:16:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302568079] [2022-12-05 23:16:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:12,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:16:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:16:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:16:12,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-05 23:16:12,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 14 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:16:12,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:12,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-05 23:16:12,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:12,603 INFO L130 PetriNetUnfolder]: 32/71 cut-off events. [2022-12-05 23:16:12,604 INFO L131 PetriNetUnfolder]: For 292/298 co-relation queries the response was YES. [2022-12-05 23:16:12,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 71 events. 32/71 cut-off events. For 292/298 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 174 event pairs, 16 based on Foata normal form. 3/70 useless extension candidates. Maximal degree in co-relation 256. Up to 56 conditions per place. [2022-12-05 23:16:12,605 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 15 selfloop transitions, 4 changer transitions 0/20 dead transitions. [2022-12-05 23:16:12,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 20 transitions, 146 flow [2022-12-05 23:16:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:16:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:16:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-05 23:16:12,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-05 23:16:12,606 INFO L175 Difference]: Start difference. First operand has 35 places, 14 transitions, 80 flow. Second operand 3 states and 23 transitions. [2022-12-05 23:16:12,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 20 transitions, 146 flow [2022-12-05 23:16:12,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 108 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-12-05 23:16:12,607 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 78 flow [2022-12-05 23:16:12,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2022-12-05 23:16:12,608 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-05 23:16:12,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:12,608 INFO L89 Accepts]: Start accepts. Operand has 28 places, 17 transitions, 78 flow [2022-12-05 23:16:12,608 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:12,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:12,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 17 transitions, 78 flow [2022-12-05 23:16:12,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 17 transitions, 78 flow [2022-12-05 23:16:12,614 INFO L130 PetriNetUnfolder]: 18/51 cut-off events. [2022-12-05 23:16:12,614 INFO L131 PetriNetUnfolder]: For 22/26 co-relation queries the response was YES. [2022-12-05 23:16:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 51 events. 18/51 cut-off events. For 22/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 142 event pairs, 9 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 124. Up to 32 conditions per place. [2022-12-05 23:16:12,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 17 transitions, 78 flow [2022-12-05 23:16:12,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-05 23:16:12,668 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:16:12,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-05 23:16:12,669 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 85 flow [2022-12-05 23:16:12,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:16:12,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:12,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:12,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:16:12,671 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-05 23:16:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash -161913325, now seen corresponding path program 1 times [2022-12-05 23:16:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:12,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304976797] [2022-12-05 23:16:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:12,763 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-05 23:16:12,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:12,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304976797] [2022-12-05 23:16:12,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304976797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:12,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:12,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:16:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963991231] [2022-12-05 23:16:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:12,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:16:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:16:12,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:16:12,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:16:12,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 23:16:12,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:12,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:16:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:12,797 INFO L130 PetriNetUnfolder]: 16/47 cut-off events. [2022-12-05 23:16:12,797 INFO L131 PetriNetUnfolder]: For 33/35 co-relation queries the response was YES. [2022-12-05 23:16:12,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 47 events. 16/47 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 5 based on Foata normal form. 4/50 useless extension candidates. Maximal degree in co-relation 165. Up to 25 conditions per place. [2022-12-05 23:16:12,798 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 15 selfloop transitions, 7 changer transitions 0/23 dead transitions. [2022-12-05 23:16:12,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 153 flow [2022-12-05 23:16:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:16:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:16:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-05 23:16:12,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.421875 [2022-12-05 23:16:12,799 INFO L175 Difference]: Start difference. First operand has 28 places, 17 transitions, 85 flow. Second operand 4 states and 27 transitions. [2022-12-05 23:16:12,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 153 flow [2022-12-05 23:16:12,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 144 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:16:12,800 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 117 flow [2022-12-05 23:16:12,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-05 23:16:12,801 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-05 23:16:12,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:12,801 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 117 flow [2022-12-05 23:16:12,802 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:12,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:12,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 117 flow [2022-12-05 23:16:12,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 117 flow [2022-12-05 23:16:12,806 INFO L130 PetriNetUnfolder]: 10/37 cut-off events. [2022-12-05 23:16:12,806 INFO L131 PetriNetUnfolder]: For 23/26 co-relation queries the response was YES. [2022-12-05 23:16:12,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 37 events. 10/37 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 3 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 111. Up to 21 conditions per place. [2022-12-05 23:16:12,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 117 flow [2022-12-05 23:16:12,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-05 23:16:12,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [254] $Ultimate##0-->L726: Formula: (and (= v_~y~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~y~0_40 v_~__unbuffered_p0_EAX~0_66) (= |v_P2Thread1of1ForFork0_#in~arg.base_13| v_P2Thread1of1ForFork0_~arg.base_13) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~x~0_72 v_~__unbuffered_p2_EAX~0_65) (= |v_P2Thread1of1ForFork0_#in~arg.offset_13| v_P2Thread1of1ForFork0_~arg.offset_13)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_13, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_13, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P0Thread1of1ForFork1_~arg.base] and [214] L756-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_34 1) v_~__unbuffered_cnt~0_33) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 23:16:12,879 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:16:12,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-05 23:16:12,881 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 124 flow [2022-12-05 23:16:12,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 23:16:12,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:12,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:12,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:16:12,882 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-05 23:16:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1798625623, now seen corresponding path program 1 times [2022-12-05 23:16:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:12,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619209267] [2022-12-05 23:16:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:12,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-05 23:16:12,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619209267] [2022-12-05 23:16:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619209267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:16:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368558656] [2022-12-05 23:16:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:12,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:16:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:12,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:16:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:16:12,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:16:12,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-05 23:16:12,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:12,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:16:12,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:13,021 INFO L130 PetriNetUnfolder]: 9/34 cut-off events. [2022-12-05 23:16:13,021 INFO L131 PetriNetUnfolder]: For 49/52 co-relation queries the response was YES. [2022-12-05 23:16:13,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 34 events. 9/34 cut-off events. For 49/52 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 59 event pairs, 2 based on Foata normal form. 4/38 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2022-12-05 23:16:13,022 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 12 selfloop transitions, 10 changer transitions 0/23 dead transitions. [2022-12-05 23:16:13,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 179 flow [2022-12-05 23:16:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:16:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:16:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-12-05 23:16:13,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-05 23:16:13,023 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 124 flow. Second operand 5 states and 28 transitions. [2022-12-05 23:16:13,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 179 flow [2022-12-05 23:16:13,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 141 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-05 23:16:13,024 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 115 flow [2022-12-05 23:16:13,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-05 23:16:13,025 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-05 23:16:13,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:16:13,025 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 115 flow [2022-12-05 23:16:13,026 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:16:13,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:13,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 115 flow [2022-12-05 23:16:13,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 115 flow [2022-12-05 23:16:13,029 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-05 23:16:13,029 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-05 23:16:13,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 26 events. 5/26 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 43 event pairs, 0 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 69. Up to 11 conditions per place. [2022-12-05 23:16:13,030 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 115 flow [2022-12-05 23:16:13,030 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-05 23:16:13,122 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:16:13,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-05 23:16:13,123 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 111 flow [2022-12-05 23:16:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-05 23:16:13,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:16:13,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:13,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:16:13,124 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-05 23:16:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:16:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1798667117, now seen corresponding path program 1 times [2022-12-05 23:16:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:16:13,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143309022] [2022-12-05 23:16:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:16:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:16:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:16:13,220 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-05 23:16:13,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:16:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143309022] [2022-12-05 23:16:13,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143309022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:16:13,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:16:13,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:16:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564227860] [2022-12-05 23:16:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:16:13,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:16:13,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:16:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:16:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:16:13,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:16:13,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 111 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-05 23:16:13,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:16:13,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:16:13,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:16:13,253 INFO L130 PetriNetUnfolder]: 9/29 cut-off events. [2022-12-05 23:16:13,253 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-05 23:16:13,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 29 events. 9/29 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 110. Up to 18 conditions per place. [2022-12-05 23:16:13,254 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2022-12-05 23:16:13,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 165 flow [2022-12-05 23:16:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:16:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:16:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-12-05 23:16:13,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 23:16:13,255 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 111 flow. Second operand 5 states and 20 transitions. [2022-12-05 23:16:13,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 165 flow [2022-12-05 23:16:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 117 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-05 23:16:13,256 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2022-12-05 23:16:13,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=26, PETRI_TRANSITIONS=0} [2022-12-05 23:16:13,256 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2022-12-05 23:16:13,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:16:13,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 0 transitions, 0 flow [2022-12-05 23:16:13,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:16:13,257 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:16:13,257 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:16:13,257 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-05 23:16:13,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:16:13,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:16:13,258 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:16:13,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-05 23:16:13,258 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:16:13,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-05 23:16:13,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 23:16:13,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-05 23:16:13,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-05 23:16:13,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-05 23:16:13,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:16:13,262 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:16:13,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:16:13,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:16:13,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:16:13 BasicIcfg [2022-12-05 23:16:13,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:16:13,267 INFO L158 Benchmark]: Toolchain (without parser) took 6193.68ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 155.8MB in the beginning and 246.9MB in the end (delta: -91.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:16:13,268 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:16:13,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.73ms. Allocated memory is still 195.0MB. Free memory was 155.3MB in the beginning and 132.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-05 23:16:13,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.40ms. Allocated memory is still 195.0MB. Free memory was 132.2MB in the beginning and 130.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:16:13,268 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 195.0MB. Free memory was 130.6MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:16:13,269 INFO L158 Benchmark]: RCFGBuilder took 472.64ms. Allocated memory is still 195.0MB. Free memory was 129.1MB in the beginning and 114.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-05 23:16:13,269 INFO L158 Benchmark]: TraceAbstraction took 5216.13ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 114.4MB in the beginning and 246.9MB in the end (delta: -132.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:16:13,270 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 421.73ms. Allocated memory is still 195.0MB. Free memory was 155.3MB in the beginning and 132.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.40ms. Allocated memory is still 195.0MB. Free memory was 132.2MB in the beginning and 130.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 195.0MB. Free memory was 130.6MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 472.64ms. Allocated memory is still 195.0MB. Free memory was 129.1MB in the beginning and 114.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5216.13ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 114.4MB in the beginning and 246.9MB in the end (delta: -132.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 78 PlacesBefore, 26 PlacesAfterwards, 69 TransitionsBefore, 17 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 678, independent: 642, independent conditional: 642, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 678, independent: 642, independent conditional: 0, independent unconditional: 642, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 678, independent: 642, independent conditional: 0, independent unconditional: 642, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 678, independent: 642, independent conditional: 0, independent unconditional: 642, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 612, independent: 584, independent conditional: 0, independent unconditional: 584, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 612, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 678, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 612, unknown conditional: 0, unknown unconditional: 612] , Statistics on independence cache: Total cache size (in pairs): 873, Positive cache size: 845, Positive conditional cache size: 0, Positive unconditional cache size: 845, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 12, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 28, independent conditional: 14, independent unconditional: 14, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 28, independent conditional: 2, independent unconditional: 26, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 28, independent conditional: 2, independent unconditional: 26, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 27, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 70, independent conditional: 14, independent unconditional: 56, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 11, unknown conditional: 2, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 10, Negative conditional cache size: 2, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 27, independent conditional: 9, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 35, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 10, Negative conditional cache size: 2, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 28 PlacesBefore, 28 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 6, independent unconditional: 3, 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: 6, independent unconditional: 3, 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: 6, independent unconditional: 3, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 10, Negative conditional cache size: 2, Negative unconditional cache size: 8, 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, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 3, independent unconditional: 1, 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: 3, independent unconditional: 1, 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: 3, independent unconditional: 1, 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: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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): 89, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 10, Negative conditional cache size: 2, Negative unconditional cache size: 8, 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, 31 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 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: 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: 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] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 10, Negative conditional cache size: 2, Negative unconditional cache size: 8, 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): 99, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 10, Negative conditional cache size: 2, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: 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, 106 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: 5.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 336 IncrementalHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 5 mSDtfsCounter, 336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=4, InterpolantAutomatonStates: 39, 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.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-05 23:16:13,293 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...