/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:01:20,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:01:20,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:01:20,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:01:20,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:01:20,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:01:20,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:01:20,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:01:20,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:01:20,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:01:20,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:01:20,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:01:20,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:01:20,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:01:20,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:01:20,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:01:20,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:01:20,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:01:20,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:01:20,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:01:20,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:01:20,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:01:20,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:01:20,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:01:20,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:01:20,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:01:20,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:01:20,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:01:20,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:01:20,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:01:20,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:01:20,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:01:20,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:01:20,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:01:20,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:01:20,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:01:20,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:01:20,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:01:20,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:01:20,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:01:20,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:01:20,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:01:20,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:01:20,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:01:20,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:01:20,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:01:20,324 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:01:20,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:01:20,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:01:20,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:01:20,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:01:20,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:01:20,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:01:20,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:01:20,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:01:20,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:01:20,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:01:20,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:01:20,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:01:20,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:01:20,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:01:20,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:01:20,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:01:20,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:01:20,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:01:20,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:01:20,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:01:20,346 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:01:20,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:01:20,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:01:20,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:01:20,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:01:20,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:01:20,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:01:20,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:01:20,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:01:20,648 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:01:20,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i [2022-12-13 09:01:21,833 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:01:22,028 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:01:22,028 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i [2022-12-13 09:01:22,041 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26195fe06/cdc8d90f1ea64aab8b8424940189083b/FLAG4a81fbaf4 [2022-12-13 09:01:22,057 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26195fe06/cdc8d90f1ea64aab8b8424940189083b [2022-12-13 09:01:22,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:01:22,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:01:22,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:01:22,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:01:22,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:01:22,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b519f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22, skipping insertion in model container [2022-12-13 09:01:22,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:01:22,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:01:22,326 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/fib_unsafe-12.i[30243,30256] [2022-12-13 09:01:22,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:01:22,357 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:01:22,408 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/fib_unsafe-12.i[30243,30256] [2022-12-13 09:01:22,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:01:22,462 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:01:22,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22 WrapperNode [2022-12-13 09:01:22,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:01:22,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:01:22,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:01:22,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:01:22,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,513 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-13 09:01:22,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:01:22,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:01:22,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:01:22,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:01:22,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,533 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:01:22,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:01:22,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:01:22,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:01:22,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:01:22,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:22,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:01:22,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:01:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 09:01:22,596 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 09:01:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 09:01:22,597 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 09:01:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:01:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:01:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:01:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:01:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:01:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:01:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:01:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:01:22,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:01:22,602 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:01:22,689 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:01:22,696 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:01:22,857 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:01:22,863 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:01:22,863 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 09:01:22,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:01:22 BoogieIcfgContainer [2022-12-13 09:01:22,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:01:22,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:01:22,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:01:22,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:01:22,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:01:22" (1/3) ... [2022-12-13 09:01:22,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf2922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:01:22, skipping insertion in model container [2022-12-13 09:01:22,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (2/3) ... [2022-12-13 09:01:22,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf2922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:01:22, skipping insertion in model container [2022-12-13 09:01:22,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:01:22" (3/3) ... [2022-12-13 09:01:22,872 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i [2022-12-13 09:01:22,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:01:22,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:01:22,889 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:01:22,940 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:01:22,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 09:01:23,034 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 09:01:23,035 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:23,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 09:01:23,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 09:01:23,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:23,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,149 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 09:01:23,149 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:23,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 09:01:23,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-13 09:01:26,197 INFO L241 LiptonReduction]: Total number of compositions: 79 [2022-12-13 09:01:26,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:01:26,214 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;@43add9e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:01:26,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 09:01:26,221 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 09:01:26,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:26,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:26,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 09:01:26,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:26,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1807783243, now seen corresponding path program 1 times [2022-12-13 09:01:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:26,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294305851] [2022-12-13 09:01:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:26,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294305851] [2022-12-13 09:01:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294305851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:01:26,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:01:26,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:01:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323543944] [2022-12-13 09:01:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:01:26,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:01:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:01:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:01:26,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:26,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:26,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:26,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:26,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:26,625 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 09:01:26,625 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 09:01:26,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 1007 events. 657/1007 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4231 event pairs, 175 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 2013. Up to 641 conditions per place. [2022-12-13 09:01:26,631 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 38 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2022-12-13 09:01:26,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 178 flow [2022-12-13 09:01:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:01:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:01:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 09:01:26,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-13 09:01:26,645 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 55 transitions. [2022-12-13 09:01:26,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 178 flow [2022-12-13 09:01:26,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:01:26,649 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 70 flow [2022-12-13 09:01:26,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-13 09:01:26,653 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 09:01:26,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:26,654 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 70 flow [2022-12-13 09:01:26,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:26,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:26,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 70 flow [2022-12-13 09:01:26,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 70 flow [2022-12-13 09:01:26,668 INFO L130 PetriNetUnfolder]: 3/28 cut-off events. [2022-12-13 09:01:26,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:26,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-13 09:01:26,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 70 flow [2022-12-13 09:01:26,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 09:01:26,674 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:01:26,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 09:01:26,678 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 70 flow [2022-12-13 09:01:26,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:26,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:26,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:26,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:01:26,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 206704716, now seen corresponding path program 1 times [2022-12-13 09:01:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72816123] [2022-12-13 09:01:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:26,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72816123] [2022-12-13 09:01:26,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72816123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512756236] [2022-12-13 09:01:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:26,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:26,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 09:01:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:26,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:26,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:26,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512756236] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:26,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:26,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205590562] [2022-12-13 09:01:26,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:26,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:26,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 09:01:26,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:26,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:26,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 09:01:26,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:27,067 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 09:01:27,068 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 09:01:27,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1391 events. 913/1391 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 09:01:27,077 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 09:01:27,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 95 transitions, 392 flow [2022-12-13 09:01:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:01:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:01:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 09:01:27,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2022-12-13 09:01:27,079 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 70 flow. Second operand 6 states and 118 transitions. [2022-12-13 09:01:27,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 95 transitions, 392 flow [2022-12-13 09:01:27,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:01:27,081 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 09:01:27,081 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 09:01:27,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:27,082 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:27,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:27,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,085 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 09:01:27,086 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:01:27,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 09:01:27,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:01:27,287 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:01:27,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-13 09:01:27,289 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 09:01:27,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:27,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:27,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:27,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:27,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:27,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 206706204, now seen corresponding path program 1 times [2022-12-13 09:01:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:27,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414719492] [2022-12-13 09:01:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:27,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:27,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414719492] [2022-12-13 09:01:27,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414719492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:27,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330465562] [2022-12-13 09:01:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:27,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:27,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:27,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:27,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 09:01:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:27,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:27,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:27,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330465562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:27,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566353422] [2022-12-13 09:01:27,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:27,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:27,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:27,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:27,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:27,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:27,945 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 09:01:27,945 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 09:01:27,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 09:01:27,952 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 09:01:27,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:01:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:01:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 09:01:27,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 09:01:27,953 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 09:01:27,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:27,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 09:01:27,959 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 09:01:27,960 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 09:01:27,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:27,960 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:27,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:27,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,964 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 09:01:27,964 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:01:27,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 09:01:27,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:01:28,155 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:01:28,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-13 09:01:28,156 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 09:01:28,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:28,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:28,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:28,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 09:01:28,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 09:01:28,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:28,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:28,357 INFO L85 PathProgramCache]: Analyzing trace with hash 206706297, now seen corresponding path program 1 times [2022-12-13 09:01:28,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:28,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109249198] [2022-12-13 09:01:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:28,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109249198] [2022-12-13 09:01:28,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109249198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:28,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848393528] [2022-12-13 09:01:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:28,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:28,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 09:01:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:28,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:28,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:28,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:28,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848393528] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:28,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:28,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843474162] [2022-12-13 09:01:28,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:28,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:28,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:28,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:28,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:28,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:28,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:28,624 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 09:01:28,624 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 09:01:28,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 09:01:28,631 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 09:01:28,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:01:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:01:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 09:01:28,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 09:01:28,648 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 09:01:28,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:28,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 09:01:28,653 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 09:01:28,653 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 09:01:28,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:28,654 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:28,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:28,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,657 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 09:01:28,657 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:01:28,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 09:01:28,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:01:28,884 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:01:28,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-13 09:01:28,885 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 09:01:28,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:28,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:28,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:28,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 09:01:29,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:29,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash 206706390, now seen corresponding path program 1 times [2022-12-13 09:01:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:29,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242537282] [2022-12-13 09:01:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:29,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242537282] [2022-12-13 09:01:29,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242537282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:29,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430459966] [2022-12-13 09:01:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:29,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:29,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:29,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:29,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 09:01:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:29,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:29,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:29,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:29,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430459966] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:29,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:29,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970846865] [2022-12-13 09:01:29,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:29,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:29,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:29,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:29,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:29,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:29,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:29,409 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 09:01:29,410 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 09:01:29,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 09:01:29,417 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 09:01:29,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:01:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:01:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 09:01:29,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 09:01:29,419 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 09:01:29,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:29,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 09:01:29,423 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:29,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 09:01:29,424 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 09:01:29,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:29,424 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:29,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:29,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:29,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:29,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:29,428 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 09:01:29,428 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:01:29,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 09:01:29,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:29,429 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:01:29,622 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:01:29,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-13 09:01:29,623 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 09:01:29,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:29,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:29,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:29,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:29,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:29,855 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash 206706483, now seen corresponding path program 1 times [2022-12-13 09:01:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:29,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443522875] [2022-12-13 09:01:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:29,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:29,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443522875] [2022-12-13 09:01:29,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443522875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:29,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851778367] [2022-12-13 09:01:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:29,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:29,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 09:01:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:29,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:29,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:29,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:29,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851778367] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:29,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:29,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796218543] [2022-12-13 09:01:29,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:29,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:29,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:29,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:29,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:29,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:29,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:30,097 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:30,097 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2022-12-13 09:01:30,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1199 events. 785/1199 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3357. Up to 449 conditions per place. [2022-12-13 09:01:30,102 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:30,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 78 transitions, 342 flow [2022-12-13 09:01:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:30,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:30,103 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:30,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 78 transitions, 342 flow [2022-12-13 09:01:30,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 09:01:30,106 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 09:01:30,107 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:30,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:30,107 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:30,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:30,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,110 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:30,110 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:30,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 09:01:30,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:30,231 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:30,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 09:01:30,231 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:30,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:30,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:30,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:30,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 09:01:30,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:30,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 206706545, now seen corresponding path program 1 times [2022-12-13 09:01:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:30,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767160600] [2022-12-13 09:01:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:30,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:30,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767160600] [2022-12-13 09:01:30,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767160600] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:30,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189358235] [2022-12-13 09:01:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:30,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:30,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:30,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:30,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 09:01:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:30,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:30,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:30,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:30,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189358235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:30,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:30,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953746038] [2022-12-13 09:01:30,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:30,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:30,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:30,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:30,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:30,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:30,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:30,752 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:30,752 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 09:01:30,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4956 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 09:01:30,756 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:30,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:30,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:30,772 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:30,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:30,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 09:01:30,774 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 09:01:30,775 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:30,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:30,775 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:30,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:30,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,777 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:30,778 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:30,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 09:01:30,778 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:30,778 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:30,894 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:30,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 09:01:30,894 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:30,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:30,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:30,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:30,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:31,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:31,095 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash 206706607, now seen corresponding path program 1 times [2022-12-13 09:01:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:31,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161815004] [2022-12-13 09:01:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:31,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161815004] [2022-12-13 09:01:31,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161815004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:31,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244045367] [2022-12-13 09:01:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:31,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:31,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:31,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:31,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 09:01:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:31,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:31,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:31,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:31,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244045367] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:31,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:31,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749111275] [2022-12-13 09:01:31,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:31,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:31,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:31,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:31,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:31,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:31,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:31,363 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:31,363 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 09:01:31,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 09:01:31,382 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:31,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:31,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:31,384 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:31,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:31,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 09:01:31,386 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 09:01:31,388 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:31,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:31,388 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:31,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:31,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,393 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:31,394 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:31,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 09:01:31,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:31,515 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:31,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 09:01:31,516 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:31,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:31,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:31,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:31,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:31,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:31,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 206706669, now seen corresponding path program 1 times [2022-12-13 09:01:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:31,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650523087] [2022-12-13 09:01:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:31,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:31,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650523087] [2022-12-13 09:01:31,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650523087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:31,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208637744] [2022-12-13 09:01:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:31,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:31,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:31,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 09:01:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:31,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:31,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:31,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:31,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208637744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:31,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:31,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828813949] [2022-12-13 09:01:31,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:31,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:31,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:31,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:31,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:31,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:31,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:31,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:31,915 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:31,915 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 09:01:31,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4956 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 09:01:31,920 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:31,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:31,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:31,920 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:31,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:31,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 09:01:31,924 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 09:01:31,924 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:31,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:31,924 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:31,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:31,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,927 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:31,927 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:31,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 09:01:31,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:31,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:32,066 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:32,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 09:01:32,066 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:32,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:32,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:32,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:32,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 09:01:32,274 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash 206706731, now seen corresponding path program 1 times [2022-12-13 09:01:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:32,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630253427] [2022-12-13 09:01:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:32,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630253427] [2022-12-13 09:01:32,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630253427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592796292] [2022-12-13 09:01:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:32,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:32,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:32,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:32,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 09:01:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:32,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:32,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:32,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:32,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592796292] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:32,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:32,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:32,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116384548] [2022-12-13 09:01:32,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:32,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:32,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:32,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:32,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:32,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:32,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:32,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:32,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:32,577 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:32,577 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 09:01:32,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 09:01:32,582 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:32,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:32,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:32,583 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:32,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:32,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 09:01:32,586 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:32,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 09:01:32,587 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:32,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:32,587 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:32,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:32,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:32,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:32,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:32,590 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:32,590 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:32,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 09:01:32,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:32,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:32,707 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:32,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 09:01:32,708 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:32,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:32,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:32,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:32,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:32,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 09:01:32,913 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash 206706793, now seen corresponding path program 1 times [2022-12-13 09:01:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:32,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449746099] [2022-12-13 09:01:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449746099] [2022-12-13 09:01:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449746099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641597572] [2022-12-13 09:01:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:32,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:32,941 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:32,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 09:01:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:32,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:32,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:33,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:33,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641597572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:33,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:33,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:33,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502112980] [2022-12-13 09:01:33,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:33,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:33,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:33,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:33,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:33,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:33,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:33,133 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:33,133 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 09:01:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 09:01:33,138 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:33,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:33,138 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:33,139 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:33,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:33,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 09:01:33,141 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:33,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 09:01:33,141 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:33,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:33,141 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:33,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:33,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:33,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:33,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:33,143 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:33,144 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:33,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 09:01:33,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:33,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:33,260 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:33,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 09:01:33,261 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:33,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:33,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:33,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:33,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:33,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 09:01:33,462 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:33,462 INFO L85 PathProgramCache]: Analyzing trace with hash 206706855, now seen corresponding path program 1 times [2022-12-13 09:01:33,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:33,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82832066] [2022-12-13 09:01:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:33,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:33,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82832066] [2022-12-13 09:01:33,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82832066] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:33,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696141087] [2022-12-13 09:01:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:33,485 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:33,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 09:01:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:33,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:33,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:33,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:33,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696141087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:33,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:33,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-13 09:01:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660817783] [2022-12-13 09:01:33,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:33,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:01:33,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:01:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:01:33,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:33,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:33,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:33,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:33,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:33,632 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 09:01:33,632 INFO L131 PetriNetUnfolder]: For 640/640 co-relation queries the response was YES. [2022-12-13 09:01:33,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 1007 events. 657/1007 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4122 event pairs, 175 based on Foata normal form. 64/579 useless extension candidates. Maximal degree in co-relation 2717. Up to 449 conditions per place. [2022-12-13 09:01:33,636 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 54 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-13 09:01:33,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 61 transitions, 266 flow [2022-12-13 09:01:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:01:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:01:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 09:01:33,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-13 09:01:33,652 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 4 states and 74 transitions. [2022-12-13 09:01:33,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 61 transitions, 266 flow [2022-12-13 09:01:33,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 61 transitions, 250 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 09:01:33,655 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:33,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-13 09:01:33,655 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-13 09:01:33,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:33,655 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:33,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:33,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:33,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:33,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:33,657 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-13 09:01:33,657 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:33,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 38. Up to 5 conditions per place. [2022-12-13 09:01:33,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:33,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 09:01:33,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:01:33,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 09:01:33,717 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 78 flow [2022-12-13 09:01:33,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:33,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:33,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:33,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:33,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 09:01:33,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash 206706886, now seen corresponding path program 1 times [2022-12-13 09:01:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:33,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690906282] [2022-12-13 09:01:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:34,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690906282] [2022-12-13 09:01:34,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690906282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:34,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939262658] [2022-12-13 09:01:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:34,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:34,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:34,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:34,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 09:01:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:34,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 09:01:34,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:34,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:34,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939262658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:34,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:34,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-13 09:01:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14550916] [2022-12-13 09:01:34,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:34,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 09:01:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 09:01:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 09:01:34,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:34,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:34,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:34,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:34,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:35,347 INFO L130 PetriNetUnfolder]: 1705/2520 cut-off events. [2022-12-13 09:01:35,347 INFO L131 PetriNetUnfolder]: For 1146/1146 co-relation queries the response was YES. [2022-12-13 09:01:35,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6272 conditions, 2520 events. 1705/2520 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12006 event pairs, 96 based on Foata normal form. 0/1082 useless extension candidates. Maximal degree in co-relation 6259. Up to 1339 conditions per place. [2022-12-13 09:01:35,360 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 80 selfloop transitions, 55 changer transitions 0/139 dead transitions. [2022-12-13 09:01:35,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 139 transitions, 614 flow [2022-12-13 09:01:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:01:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:01:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 09:01:35,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2022-12-13 09:01:35,361 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 78 flow. Second operand 8 states and 170 transitions. [2022-12-13 09:01:35,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 139 transitions, 614 flow [2022-12-13 09:01:35,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 139 transitions, 582 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 09:01:35,363 INFO L231 Difference]: Finished difference. Result has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:35,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=41, PETRI_TRANSITIONS=83} [2022-12-13 09:01:35,364 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-13 09:01:35,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:35,364 INFO L89 Accepts]: Start accepts. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:35,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:35,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:35,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:35,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:35,380 INFO L130 PetriNetUnfolder]: 329/525 cut-off events. [2022-12-13 09:01:35,381 INFO L131 PetriNetUnfolder]: For 214/222 co-relation queries the response was YES. [2022-12-13 09:01:35,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 525 events. 329/525 cut-off events. For 214/222 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2156 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 1224. Up to 377 conditions per place. [2022-12-13 09:01:35,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:35,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-13 09:01:35,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (< v_~p~0_23 12) (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 09:01:35,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:01:35,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44)) (< v_~q~0_17 12)) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 09:01:35,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (< v_~p~0_44 12) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:01:35,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 12)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 09:01:35,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 12) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:01:35,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 12) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:01:35,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111) (< v_~p~0_48 12)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:01:35,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (< v_~p~0_23 12) (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 09:01:35,856 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:01:35,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44)) (< v_~q~0_17 12)) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 09:01:35,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (< v_~p~0_44 12) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:01:35,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 12)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 09:01:36,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 12) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:01:36,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 12) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:01:36,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111) (< v_~p~0_48 12)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:01:36,183 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:36,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 820 [2022-12-13 09:01:36,184 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 83 transitions, 449 flow [2022-12-13 09:01:36,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:36,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:36,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:36,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 09:01:36,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 09:01:36,384 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 206707134, now seen corresponding path program 1 times [2022-12-13 09:01:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:36,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571714394] [2022-12-13 09:01:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:36,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571714394] [2022-12-13 09:01:36,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571714394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:01:36,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:01:36,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:01:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176685333] [2022-12-13 09:01:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:01:36,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:01:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:01:36,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:01:36,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2022-12-13 09:01:36,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 83 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:36,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:36,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2022-12-13 09:01:36,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:36,515 INFO L130 PetriNetUnfolder]: 1214/1850 cut-off events. [2022-12-13 09:01:36,516 INFO L131 PetriNetUnfolder]: For 1116/1116 co-relation queries the response was YES. [2022-12-13 09:01:36,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 1850 events. 1214/1850 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 9049 event pairs, 368 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 5536. Up to 907 conditions per place. [2022-12-13 09:01:36,522 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 63 selfloop transitions, 18 changer transitions 2/87 dead transitions. [2022-12-13 09:01:36,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 87 transitions, 603 flow [2022-12-13 09:01:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:01:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:01:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 09:01:36,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-13 09:01:36,523 INFO L175 Difference]: Start difference. First operand has 41 places, 83 transitions, 449 flow. Second operand 3 states and 70 transitions. [2022-12-13 09:01:36,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 87 transitions, 603 flow [2022-12-13 09:01:36,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 87 transitions, 567 flow, removed 18 selfloop flow, removed 0 redundant places. [2022-12-13 09:01:36,529 INFO L231 Difference]: Finished difference. Result has 42 places, 69 transitions, 375 flow [2022-12-13 09:01:36,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=42, PETRI_TRANSITIONS=69} [2022-12-13 09:01:36,530 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-13 09:01:36,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:36,530 INFO L89 Accepts]: Start accepts. Operand has 42 places, 69 transitions, 375 flow [2022-12-13 09:01:36,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:36,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:36,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 69 transitions, 375 flow [2022-12-13 09:01:36,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 69 transitions, 375 flow [2022-12-13 09:01:36,546 INFO L130 PetriNetUnfolder]: 272/441 cut-off events. [2022-12-13 09:01:36,546 INFO L131 PetriNetUnfolder]: For 235/243 co-relation queries the response was YES. [2022-12-13 09:01:36,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 441 events. 272/441 cut-off events. For 235/243 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 1811 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 1129. Up to 321 conditions per place. [2022-12-13 09:01:36,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 69 transitions, 375 flow [2022-12-13 09:01:36,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 09:01:36,553 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:01:36,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 09:01:36,553 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 69 transitions, 375 flow [2022-12-13 09:01:36,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:36,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:36,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:36,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:01:36,554 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:01:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1349048539, now seen corresponding path program 1 times [2022-12-13 09:01:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:36,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136683441] [2022-12-13 09:01:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:36,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136683441] [2022-12-13 09:01:36,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136683441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:36,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000239359] [2022-12-13 09:01:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:36,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:36,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:36,703 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:01:36,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 09:01:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:36,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 09:01:36,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:36,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:01:37,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000239359] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:37,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:37,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 09:01:37,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632089749] [2022-12-13 09:01:37,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:37,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 09:01:37,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 09:01:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 09:01:37,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 09:01:37,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 69 transitions, 375 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:01:37,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:37,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 09:01:37,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:41,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:43,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:44,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:45,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:47,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:49,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:52,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:54,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:56,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:01:58,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:00,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:02,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:04,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:06,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:08,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:09,105 INFO L130 PetriNetUnfolder]: 2780/4195 cut-off events. [2022-12-13 09:02:09,106 INFO L131 PetriNetUnfolder]: For 4295/4295 co-relation queries the response was YES. [2022-12-13 09:02:09,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12598 conditions, 4195 events. 2780/4195 cut-off events. For 4295/4295 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 23588 event pairs, 100 based on Foata normal form. 168/2451 useless extension candidates. Maximal degree in co-relation 12581. Up to 2080 conditions per place. [2022-12-13 09:02:09,121 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 110 selfloop transitions, 131 changer transitions 0/245 dead transitions. [2022-12-13 09:02:09,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 245 transitions, 1498 flow [2022-12-13 09:02:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 09:02:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 09:02:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2022-12-13 09:02:09,123 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 09:02:09,123 INFO L175 Difference]: Start difference. First operand has 40 places, 69 transitions, 375 flow. Second operand 12 states and 276 transitions. [2022-12-13 09:02:09,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 245 transitions, 1498 flow [2022-12-13 09:02:09,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 245 transitions, 1426 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 09:02:09,146 INFO L231 Difference]: Finished difference. Result has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:09,146 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1121, PETRI_PLACES=51, PETRI_TRANSITIONS=159} [2022-12-13 09:02:09,147 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-13 09:02:09,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:09,147 INFO L89 Accepts]: Start accepts. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:09,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:09,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:09,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:09,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:09,189 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-13 09:02:09,189 INFO L131 PetriNetUnfolder]: For 739/803 co-relation queries the response was YES. [2022-12-13 09:02:09,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 1017 events. 604/1017 cut-off events. For 739/803 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 5577 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 3341. Up to 777 conditions per place. [2022-12-13 09:02:09,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:09,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 1940 [2022-12-13 09:02:09,196 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:09,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 09:02:09,196 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:09,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:02:09,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:09,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:09,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 09:02:09,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 09:02:09,401 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:02:09,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1348910465, now seen corresponding path program 1 times [2022-12-13 09:02:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:09,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308933705] [2022-12-13 09:02:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:09,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308933705] [2022-12-13 09:02:09,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308933705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:09,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987100653] [2022-12-13 09:02:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:09,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:09,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:09,432 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:02:09,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 09:02:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:09,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:02:09,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:09,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:02:09,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987100653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:02:09,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:02:09,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 09:02:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208569654] [2022-12-13 09:02:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:02:09,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:02:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:02:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:02:09,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 09:02:09,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 159 transitions, 1121 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:02:09,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:09,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 09:02:09,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:09,698 INFO L130 PetriNetUnfolder]: 1996/3189 cut-off events. [2022-12-13 09:02:09,698 INFO L131 PetriNetUnfolder]: For 3541/3541 co-relation queries the response was YES. [2022-12-13 09:02:09,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10876 conditions, 3189 events. 1996/3189 cut-off events. For 3541/3541 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 19064 event pairs, 711 based on Foata normal form. 350/1907 useless extension candidates. Maximal degree in co-relation 10857. Up to 1634 conditions per place. [2022-12-13 09:02:09,710 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 133 selfloop transitions, 28 changer transitions 0/165 dead transitions. [2022-12-13 09:02:09,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 165 transitions, 1428 flow [2022-12-13 09:02:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:02:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:02:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 09:02:09,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 09:02:09,712 INFO L175 Difference]: Start difference. First operand has 51 places, 159 transitions, 1121 flow. Second operand 4 states and 72 transitions. [2022-12-13 09:02:09,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 165 transitions, 1428 flow [2022-12-13 09:02:09,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 165 transitions, 1295 flow, removed 58 selfloop flow, removed 1 redundant places. [2022-12-13 09:02:09,731 INFO L231 Difference]: Finished difference. Result has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:09,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=949, PETRI_PLACES=52, PETRI_TRANSITIONS=141} [2022-12-13 09:02:09,732 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-13 09:02:09,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:09,732 INFO L89 Accepts]: Start accepts. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:09,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:09,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:09,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:09,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:09,766 INFO L130 PetriNetUnfolder]: 424/781 cut-off events. [2022-12-13 09:02:09,766 INFO L131 PetriNetUnfolder]: For 800/844 co-relation queries the response was YES. [2022-12-13 09:02:09,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 781 events. 424/781 cut-off events. For 800/844 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 4504 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 2281. Up to 405 conditions per place. [2022-12-13 09:02:09,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:09,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 1632 [2022-12-13 09:02:09,772 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:09,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 09:02:09,773 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:09,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:02:09,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:09,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:09,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 09:02:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:09,978 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:02:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1025623958, now seen corresponding path program 1 times [2022-12-13 09:02:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:09,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135087901] [2022-12-13 09:02:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:10,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135087901] [2022-12-13 09:02:10,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135087901] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344390853] [2022-12-13 09:02:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:10,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:10,098 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:02:10,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 09:02:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:10,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 09:02:10,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:10,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:02:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:10,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344390853] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:02:10,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:02:10,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 09:02:10,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534259860] [2022-12-13 09:02:10,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:02:10,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 09:02:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:10,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 09:02:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 09:02:10,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:02:10,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 141 transitions, 949 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:02:10,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:10,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:02:10,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:14,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:16,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:18,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:20,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:22,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:24,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:26,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:28,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:30,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:32,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:34,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:36,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:38,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:40,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:42,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:44,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:46,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:48,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:50,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:52,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:54,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:54,532 INFO L130 PetriNetUnfolder]: 3207/5195 cut-off events. [2022-12-13 09:02:54,533 INFO L131 PetriNetUnfolder]: For 7706/7706 co-relation queries the response was YES. [2022-12-13 09:02:54,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 5195 events. 3207/5195 cut-off events. For 7706/7706 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 34522 event pairs, 163 based on Foata normal form. 168/2671 useless extension candidates. Maximal degree in co-relation 16240. Up to 2900 conditions per place. [2022-12-13 09:02:54,551 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 137 selfloop transitions, 161 changer transitions 0/302 dead transitions. [2022-12-13 09:02:54,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 302 transitions, 2129 flow [2022-12-13 09:02:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:02:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 09:02:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 242 transitions. [2022-12-13 09:02:54,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2022-12-13 09:02:54,552 INFO L175 Difference]: Start difference. First operand has 52 places, 141 transitions, 949 flow. Second operand 11 states and 242 transitions. [2022-12-13 09:02:54,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 302 transitions, 2129 flow [2022-12-13 09:02:54,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 302 transitions, 2096 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:02:54,604 INFO L231 Difference]: Finished difference. Result has 66 places, 229 transitions, 1926 flow [2022-12-13 09:02:54,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1926, PETRI_PLACES=66, PETRI_TRANSITIONS=229} [2022-12-13 09:02:54,605 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2022-12-13 09:02:54,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:54,605 INFO L89 Accepts]: Start accepts. Operand has 66 places, 229 transitions, 1926 flow [2022-12-13 09:02:54,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:54,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:54,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 229 transitions, 1926 flow [2022-12-13 09:02:54,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 229 transitions, 1926 flow [2022-12-13 09:02:54,652 INFO L130 PetriNetUnfolder]: 640/1265 cut-off events. [2022-12-13 09:02:54,652 INFO L131 PetriNetUnfolder]: For 2609/2689 co-relation queries the response was YES. [2022-12-13 09:02:54,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1265 events. 640/1265 cut-off events. For 2609/2689 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 8748 event pairs, 0 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 4977. Up to 733 conditions per place. [2022-12-13 09:02:54,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 229 transitions, 1926 flow [2022-12-13 09:02:54,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-13 09:02:54,661 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:54,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 09:02:54,661 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 229 transitions, 1926 flow [2022-12-13 09:02:54,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:02:54,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:54,661 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:54,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 09:02:54,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 09:02:54,868 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:02:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1134578441, now seen corresponding path program 1 times [2022-12-13 09:02:54,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:54,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911396261] [2022-12-13 09:02:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:54,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911396261] [2022-12-13 09:02:54,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911396261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670150417] [2022-12-13 09:02:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:54,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:54,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:54,998 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:02:54,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 09:02:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:55,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 09:02:55,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:55,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:02:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:55,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670150417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:02:55,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:02:55,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 09:02:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559013164] [2022-12-13 09:02:55,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:02:55,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:02:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:02:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:02:55,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:02:55,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 229 transitions, 1926 flow. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:02:55,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:55,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:02:55,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:58,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:01,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:02,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:04,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:06,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:08,821 INFO L130 PetriNetUnfolder]: 4894/7954 cut-off events. [2022-12-13 09:03:08,821 INFO L131 PetriNetUnfolder]: For 24823/24823 co-relation queries the response was YES. [2022-12-13 09:03:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31007 conditions, 7954 events. 4894/7954 cut-off events. For 24823/24823 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 56888 event pairs, 202 based on Foata normal form. 154/4038 useless extension candidates. Maximal degree in co-relation 30981. Up to 3229 conditions per place. [2022-12-13 09:03:08,926 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 142 selfloop transitions, 255 changer transitions 0/401 dead transitions. [2022-12-13 09:03:08,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 401 transitions, 3464 flow [2022-12-13 09:03:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 09:03:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 09:03:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 277 transitions. [2022-12-13 09:03:08,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368217054263565 [2022-12-13 09:03:08,932 INFO L175 Difference]: Start difference. First operand has 66 places, 229 transitions, 1926 flow. Second operand 12 states and 277 transitions. [2022-12-13 09:03:08,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 401 transitions, 3464 flow [2022-12-13 09:03:09,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 401 transitions, 3285 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-13 09:03:09,114 INFO L231 Difference]: Finished difference. Result has 78 places, 306 transitions, 3054 flow [2022-12-13 09:03:09,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3054, PETRI_PLACES=78, PETRI_TRANSITIONS=306} [2022-12-13 09:03:09,114 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 09:03:09,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:03:09,114 INFO L89 Accepts]: Start accepts. Operand has 78 places, 306 transitions, 3054 flow [2022-12-13 09:03:09,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:03:09,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:03:09,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 306 transitions, 3054 flow [2022-12-13 09:03:09,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 306 transitions, 3054 flow [2022-12-13 09:03:09,204 INFO L130 PetriNetUnfolder]: 968/1957 cut-off events. [2022-12-13 09:03:09,205 INFO L131 PetriNetUnfolder]: For 7416/7487 co-relation queries the response was YES. [2022-12-13 09:03:09,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9401 conditions, 1957 events. 968/1957 cut-off events. For 7416/7487 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 15224 event pairs, 0 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 9373. Up to 1161 conditions per place. [2022-12-13 09:03:09,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 306 transitions, 3054 flow [2022-12-13 09:03:09,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 3424 [2022-12-13 09:03:09,219 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:03:09,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 09:03:09,220 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 306 transitions, 3054 flow [2022-12-13 09:03:09,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:03:09,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:03:09,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:03:09,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 09:03:09,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 09:03:09,423 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:03:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:03:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1931238927, now seen corresponding path program 1 times [2022-12-13 09:03:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:03:09,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992720339] [2022-12-13 09:03:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:03:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:03:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:03:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:03:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:03:09,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992720339] [2022-12-13 09:03:09,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992720339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:03:09,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487370540] [2022-12-13 09:03:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:03:09,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:03:09,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:03:09,568 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:03:09,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 09:03:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:03:09,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:03:09,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:03:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:03:09,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:03:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:03:09,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487370540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:03:09,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:03:09,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 09:03:09,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205140141] [2022-12-13 09:03:09,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:03:09,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:03:09,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:03:09,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:03:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:03:09,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:03:09,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 306 transitions, 3054 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:03:09,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:03:09,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:03:09,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:03:19,067 WARN L233 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 52 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:03:21,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:27,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:29,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:30,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:32,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:34,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:36,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:38,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:40,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:42,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:44,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:46,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:53,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:57,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:59,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:01,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:03,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:05,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:08,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:08,602 INFO L130 PetriNetUnfolder]: 5104/8468 cut-off events. [2022-12-13 09:04:08,602 INFO L131 PetriNetUnfolder]: For 48040/48040 co-relation queries the response was YES. [2022-12-13 09:04:08,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37256 conditions, 8468 events. 5104/8468 cut-off events. For 48040/48040 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 63141 event pairs, 299 based on Foata normal form. 301/4299 useless extension candidates. Maximal degree in co-relation 37225. Up to 4766 conditions per place. [2022-12-13 09:04:08,643 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 220 selfloop transitions, 278 changer transitions 0/502 dead transitions. [2022-12-13 09:04:08,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 502 transitions, 4958 flow [2022-12-13 09:04:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 09:04:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 09:04:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 357 transitions. [2022-12-13 09:04:08,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2022-12-13 09:04:08,645 INFO L175 Difference]: Start difference. First operand has 78 places, 306 transitions, 3054 flow. Second operand 17 states and 357 transitions. [2022-12-13 09:04:08,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 502 transitions, 4958 flow [2022-12-13 09:04:08,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 502 transitions, 4559 flow, removed 85 selfloop flow, removed 8 redundant places. [2022-12-13 09:04:08,981 INFO L231 Difference]: Finished difference. Result has 91 places, 386 transitions, 4209 flow [2022-12-13 09:04:08,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4209, PETRI_PLACES=91, PETRI_TRANSITIONS=386} [2022-12-13 09:04:08,981 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2022-12-13 09:04:08,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:04:08,981 INFO L89 Accepts]: Start accepts. Operand has 91 places, 386 transitions, 4209 flow [2022-12-13 09:04:08,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:04:08,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:04:08,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 386 transitions, 4209 flow [2022-12-13 09:04:08,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 386 transitions, 4209 flow [2022-12-13 09:04:09,107 INFO L130 PetriNetUnfolder]: 1096/2249 cut-off events. [2022-12-13 09:04:09,107 INFO L131 PetriNetUnfolder]: For 6486/6557 co-relation queries the response was YES. [2022-12-13 09:04:09,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11090 conditions, 2249 events. 1096/2249 cut-off events. For 6486/6557 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 18221 event pairs, 0 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 11061. Up to 1317 conditions per place. [2022-12-13 09:04:09,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 386 transitions, 4209 flow [2022-12-13 09:04:09,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 4064 [2022-12-13 09:04:09,122 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:04:09,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 09:04:09,122 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 386 transitions, 4209 flow [2022-12-13 09:04:09,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:04:09,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:04:09,123 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:04:09,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 09:04:09,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:04:09,327 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:04:09,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:04:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash -810562866, now seen corresponding path program 1 times [2022-12-13 09:04:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:04:09,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274966916] [2022-12-13 09:04:09,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:04:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:04:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:04:09,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274966916] [2022-12-13 09:04:09,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274966916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:04:09,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758736477] [2022-12-13 09:04:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:09,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:04:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:04:09,469 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:04:09,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 09:04:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:09,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 09:04:09,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:04:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:04:09,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:04:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:04:09,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758736477] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:04:09,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:04:09,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:04:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947389194] [2022-12-13 09:04:09,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:04:09,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:04:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:04:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:04:09,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:04:09,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:04:09,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 386 transitions, 4209 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:04:09,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:04:09,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:04:09,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:04:11,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:21,618 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 54 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:04:24,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:27,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:29,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:31,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:33,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:39,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:41,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:56,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:58,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:00,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:03,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:06,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:08,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:10,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:12,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:14,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:15,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:18,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:20,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:22,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:25,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:27,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:29,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:31,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:33,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:34,432 INFO L130 PetriNetUnfolder]: 5674/9606 cut-off events. [2022-12-13 09:05:34,432 INFO L131 PetriNetUnfolder]: For 61365/61365 co-relation queries the response was YES. [2022-12-13 09:05:34,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44084 conditions, 9606 events. 5674/9606 cut-off events. For 61365/61365 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 73672 event pairs, 296 based on Foata normal form. 301/4722 useless extension candidates. Maximal degree in co-relation 44052. Up to 5698 conditions per place. [2022-12-13 09:05:34,463 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 302 selfloop transitions, 279 changer transitions 15/600 dead transitions. [2022-12-13 09:05:34,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 600 transitions, 6517 flow [2022-12-13 09:05:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:05:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 09:05:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 407 transitions. [2022-12-13 09:05:34,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47325581395348837 [2022-12-13 09:05:34,465 INFO L175 Difference]: Start difference. First operand has 91 places, 386 transitions, 4209 flow. Second operand 20 states and 407 transitions. [2022-12-13 09:05:34,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 600 transitions, 6517 flow [2022-12-13 09:05:34,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 600 transitions, 6175 flow, removed 40 selfloop flow, removed 9 redundant places. [2022-12-13 09:05:34,934 INFO L231 Difference]: Finished difference. Result has 106 places, 455 transitions, 5385 flow [2022-12-13 09:05:34,934 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5385, PETRI_PLACES=106, PETRI_TRANSITIONS=455} [2022-12-13 09:05:34,935 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 74 predicate places. [2022-12-13 09:05:34,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:05:34,935 INFO L89 Accepts]: Start accepts. Operand has 106 places, 455 transitions, 5385 flow [2022-12-13 09:05:34,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:05:34,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:05:34,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 455 transitions, 5385 flow [2022-12-13 09:05:34,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 455 transitions, 5385 flow [2022-12-13 09:05:35,090 INFO L130 PetriNetUnfolder]: 1311/2766 cut-off events. [2022-12-13 09:05:35,090 INFO L131 PetriNetUnfolder]: For 14091/14186 co-relation queries the response was YES. [2022-12-13 09:05:35,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15172 conditions, 2766 events. 1311/2766 cut-off events. For 14091/14186 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 22866 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 15137. Up to 1645 conditions per place. [2022-12-13 09:05:35,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 455 transitions, 5385 flow [2022-12-13 09:05:35,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 4656 [2022-12-13 09:05:35,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (< v_~p~0_44 12) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:05:35,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 12) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:05:35,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 12)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 09:05:35,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:05:35,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 12) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:05:35,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111) (< v_~p~0_48 12)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:05:35,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [282] L695-5-->L698: Formula: (and (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44)) (< v_~q~0_17 12)) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 09:05:35,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [279] L687-5-->L687-3: Formula: (and (< v_~p~0_23 12) (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 09:05:35,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 26)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (< v_~p~0_44 12) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:05:36,078 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:05:36,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1143 [2022-12-13 09:05:36,078 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 454 transitions, 5655 flow [2022-12-13 09:05:36,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:05:36,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:05:36,079 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:05:36,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 09:05:36,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:05:36,279 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:05:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:05:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1930675750, now seen corresponding path program 1 times [2022-12-13 09:05:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:05:36,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881596752] [2022-12-13 09:05:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:05:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:05:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:05:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:05:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:05:36,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881596752] [2022-12-13 09:05:36,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881596752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:05:36,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316254327] [2022-12-13 09:05:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:05:36,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:05:36,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:05:36,394 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:05:36,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 09:05:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:05:36,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:05:36,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:05:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:05:36,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:05:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:05:36,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316254327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:05:36,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:05:36,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 09:05:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266775872] [2022-12-13 09:05:36,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:05:36,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:05:36,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:05:36,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:05:36,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:05:36,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 56 [2022-12-13 09:05:36,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 454 transitions, 5655 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:05:36,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:05:36,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 56 [2022-12-13 09:05:36,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:05:42,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:44,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:46,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:48,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:50,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:53,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:55,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:57,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:59,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:01,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:10,712 WARN L233 SmtUtils]: Spent 8.70s on a formula simplification. DAG size of input: 57 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:06:13,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:18,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:20,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:22,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:24,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:26,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:33,355 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 52 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:06:34,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:36,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:38,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:41,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:43,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:46,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:47,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:49,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:51,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:53,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:55,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:57,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:06:59,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:01,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:04,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:06,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:08,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:10,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:12,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:14,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:16,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:18,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:19,376 INFO L130 PetriNetUnfolder]: 5944/10288 cut-off events. [2022-12-13 09:07:19,376 INFO L131 PetriNetUnfolder]: For 72265/72265 co-relation queries the response was YES. [2022-12-13 09:07:19,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50637 conditions, 10288 events. 5944/10288 cut-off events. For 72265/72265 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 83123 event pairs, 389 based on Foata normal form. 210/4847 useless extension candidates. Maximal degree in co-relation 50599. Up to 6148 conditions per place. [2022-12-13 09:07:19,414 INFO L137 encePairwiseOnDemand]: 16/56 looper letters, 329 selfloop transitions, 321 changer transitions 15/669 dead transitions. [2022-12-13 09:07:19,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 669 transitions, 8344 flow [2022-12-13 09:07:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:07:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 09:07:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 329 transitions. [2022-12-13 09:07:19,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2022-12-13 09:07:19,415 INFO L175 Difference]: Start difference. First operand has 105 places, 454 transitions, 5655 flow. Second operand 15 states and 329 transitions. [2022-12-13 09:07:19,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 669 transitions, 8344 flow [2022-12-13 09:07:20,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 669 transitions, 7937 flow, removed 91 selfloop flow, removed 8 redundant places. [2022-12-13 09:07:20,057 INFO L231 Difference]: Finished difference. Result has 114 places, 554 transitions, 7302 flow [2022-12-13 09:07:20,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=4915, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7302, PETRI_PLACES=114, PETRI_TRANSITIONS=554} [2022-12-13 09:07:20,058 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 82 predicate places. [2022-12-13 09:07:20,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:07:20,058 INFO L89 Accepts]: Start accepts. Operand has 114 places, 554 transitions, 7302 flow [2022-12-13 09:07:20,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:07:20,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:07:20,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 554 transitions, 7302 flow [2022-12-13 09:07:20,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 554 transitions, 7302 flow [2022-12-13 09:07:20,261 INFO L130 PetriNetUnfolder]: 1439/3102 cut-off events. [2022-12-13 09:07:20,261 INFO L131 PetriNetUnfolder]: For 15234/15362 co-relation queries the response was YES. [2022-12-13 09:07:20,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18252 conditions, 3102 events. 1439/3102 cut-off events. For 15234/15362 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 27029 event pairs, 0 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 18213. Up to 1720 conditions per place. [2022-12-13 09:07:20,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 554 transitions, 7302 flow [2022-12-13 09:07:20,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 5372 [2022-12-13 09:07:20,283 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:07:20,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-13 09:07:20,284 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 554 transitions, 7302 flow [2022-12-13 09:07:20,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:07:20,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:07:20,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:07:20,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 09:07:20,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:07:20,489 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:07:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:07:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1930671937, now seen corresponding path program 1 times [2022-12-13 09:07:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:07:20,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146748150] [2022-12-13 09:07:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:07:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:07:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:07:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:07:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:07:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146748150] [2022-12-13 09:07:20,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146748150] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:07:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910883279] [2022-12-13 09:07:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:07:20,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:07:20,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:07:20,620 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:07:20,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 09:07:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:07:20,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:07:20,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:07:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:07:20,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:07:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:07:21,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910883279] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:07:21,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:07:21,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 09:07:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952173025] [2022-12-13 09:07:21,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:07:21,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:07:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:07:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:07:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:07:21,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 48 [2022-12-13 09:07:21,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 554 transitions, 7302 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:07:21,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:07:21,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 48 [2022-12-13 09:07:21,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:07:28,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:34,788 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 57 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:07:36,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:38,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:41,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:53,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:55,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:57,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:59,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:01,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:04,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:06,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:08,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:11,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:13,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:15,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:17,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:19,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:21,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:24,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:26,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:28,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:30,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:32,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:34,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:36,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:38,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:40,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:41,144 INFO L130 PetriNetUnfolder]: 5931/10276 cut-off events. [2022-12-13 09:08:41,145 INFO L131 PetriNetUnfolder]: For 52830/52830 co-relation queries the response was YES. [2022-12-13 09:08:41,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53942 conditions, 10276 events. 5931/10276 cut-off events. For 52830/52830 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 83100 event pairs, 383 based on Foata normal form. 21/4663 useless extension candidates. Maximal degree in co-relation 53900. Up to 6098 conditions per place. [2022-12-13 09:08:41,186 INFO L137 encePairwiseOnDemand]: 16/48 looper letters, 319 selfloop transitions, 330 changer transitions 12/665 dead transitions. [2022-12-13 09:08:41,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 665 transitions, 8946 flow [2022-12-13 09:08:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:08:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 09:08:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 329 transitions. [2022-12-13 09:08:41,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4283854166666667 [2022-12-13 09:08:41,187 INFO L175 Difference]: Start difference. First operand has 114 places, 554 transitions, 7302 flow. Second operand 16 states and 329 transitions. [2022-12-13 09:08:41,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 665 transitions, 8946 flow [2022-12-13 09:08:42,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 665 transitions, 8673 flow, removed 57 selfloop flow, removed 7 redundant places. [2022-12-13 09:08:42,030 INFO L231 Difference]: Finished difference. Result has 125 places, 553 transitions, 8008 flow [2022-12-13 09:08:42,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7029, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8008, PETRI_PLACES=125, PETRI_TRANSITIONS=553} [2022-12-13 09:08:42,031 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 93 predicate places. [2022-12-13 09:08:42,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:08:42,031 INFO L89 Accepts]: Start accepts. Operand has 125 places, 553 transitions, 8008 flow [2022-12-13 09:08:42,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:08:42,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:08:42,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 553 transitions, 8008 flow [2022-12-13 09:08:42,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 553 transitions, 8008 flow [2022-12-13 09:08:42,345 INFO L130 PetriNetUnfolder]: 1466/3144 cut-off events. [2022-12-13 09:08:42,345 INFO L131 PetriNetUnfolder]: For 17911/18039 co-relation queries the response was YES. [2022-12-13 09:08:42,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20022 conditions, 3144 events. 1466/3144 cut-off events. For 17911/18039 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 27359 event pairs, 0 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 19980. Up to 1529 conditions per place. [2022-12-13 09:08:42,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 553 transitions, 8008 flow [2022-12-13 09:08:42,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 5358 [2022-12-13 09:08:42,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L705-6-->L690: Formula: (and (= v_~next~0_160 v_~cur~0_253) (< v_~p~0_71 12) (= (+ 26 v_~x~0_279) v_~x~0_278) (= (+ (* 46368 v_~next~0_160) v_~prev~0_281 v_~cur~0_254) (* 75025 v_~prev~0_280)) (= (* 75025 v_~next~0_160) (+ (* 121393 v_~prev~0_280) v_~cur~0_254)) (< v_~x~0_279 1) (= v_~i~0_159 (+ v_~j~0_155 v_~i~0_160))) InVars {~j~0=v_~j~0_155, ~prev~0=v_~prev~0_281, ~i~0=v_~i~0_160, ~p~0=v_~p~0_71, ~cur~0=v_~cur~0_254, ~x~0=v_~x~0_279} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_171|, ~j~0=v_~j~0_155, ~next~0=v_~next~0_160, ~prev~0=v_~prev~0_280, ~i~0=v_~i~0_159, ~p~0=v_~p~0_71, ~cur~0=v_~cur~0_253, ~x~0=v_~x~0_278} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:08:42,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:08:42,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-13 09:08:42,425 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 552 transitions, 7996 flow [2022-12-13 09:08:42,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:08:42,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:08:42,425 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:08:42,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 09:08:42,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 09:08:42,629 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:08:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:08:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2075010178, now seen corresponding path program 1 times [2022-12-13 09:08:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:08:42,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579900210] [2022-12-13 09:08:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:08:42,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:08:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:08:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:08:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:08:42,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579900210] [2022-12-13 09:08:42,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579900210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:08:42,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544379575] [2022-12-13 09:08:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:08:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:08:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:08:42,797 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:08:42,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 09:08:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:08:42,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:08:42,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:08:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:08:43,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:08:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:08:45,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544379575] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:08:45,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:08:45,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:08:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789804375] [2022-12-13 09:08:45,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:08:45,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:08:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:08:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:08:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=190, Unknown=1, NotChecked=0, Total=272 [2022-12-13 09:08:45,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2022-12-13 09:08:45,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 552 transitions, 7996 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:08:45,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:08:45,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2022-12-13 09:08:45,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:08:51,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:54,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:56,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:08:58,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:00,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:02,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:03,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:07,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:10,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:12,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:14,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:18,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:20,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:22,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:23,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:25,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:27,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:31,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:33,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:35,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:37,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:40,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:42,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:45,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:47,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:49,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:51,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:54,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:56,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:57,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:01,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:02,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:04,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:07,757 INFO L130 PetriNetUnfolder]: 8283/14269 cut-off events. [2022-12-13 09:10:07,757 INFO L131 PetriNetUnfolder]: For 145232/145232 co-relation queries the response was YES. [2022-12-13 09:10:07,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81985 conditions, 14269 events. 8283/14269 cut-off events. For 145232/145232 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 120417 event pairs, 410 based on Foata normal form. 147/6863 useless extension candidates. Maximal degree in co-relation 81940. Up to 5835 conditions per place. [2022-12-13 09:10:07,832 INFO L137 encePairwiseOnDemand]: 16/49 looper letters, 330 selfloop transitions, 478 changer transitions 3/815 dead transitions. [2022-12-13 09:10:07,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 815 transitions, 12216 flow [2022-12-13 09:10:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:10:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 09:10:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 338 transitions. [2022-12-13 09:10:07,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4598639455782313 [2022-12-13 09:10:07,834 INFO L175 Difference]: Start difference. First operand has 124 places, 552 transitions, 7996 flow. Second operand 15 states and 338 transitions. [2022-12-13 09:10:07,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 815 transitions, 12216 flow [2022-12-13 09:10:09,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 815 transitions, 11894 flow, removed 13 selfloop flow, removed 11 redundant places. [2022-12-13 09:10:09,300 INFO L231 Difference]: Finished difference. Result has 130 places, 699 transitions, 11107 flow [2022-12-13 09:10:09,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7680, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11107, PETRI_PLACES=130, PETRI_TRANSITIONS=699} [2022-12-13 09:10:09,300 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2022-12-13 09:10:09,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:10:09,300 INFO L89 Accepts]: Start accepts. Operand has 130 places, 699 transitions, 11107 flow [2022-12-13 09:10:09,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:10:09,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:10:09,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 699 transitions, 11107 flow [2022-12-13 09:10:09,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 699 transitions, 11107 flow [2022-12-13 09:10:09,639 INFO L130 PetriNetUnfolder]: 2074/4432 cut-off events. [2022-12-13 09:10:09,639 INFO L131 PetriNetUnfolder]: For 38638/38775 co-relation queries the response was YES. [2022-12-13 09:10:09,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31869 conditions, 4432 events. 2074/4432 cut-off events. For 38638/38775 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 40702 event pairs, 6 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 31824. Up to 2298 conditions per place. [2022-12-13 09:10:09,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 699 transitions, 11107 flow [2022-12-13 09:10:09,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 6788 [2022-12-13 09:10:09,712 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:10:09,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 412 [2022-12-13 09:10:09,713 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 699 transitions, 11107 flow [2022-12-13 09:10:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:10:09,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:10:09,713 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:10:09,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 09:10:09,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 09:10:09,918 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:10:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash -262182874, now seen corresponding path program 1 times [2022-12-13 09:10:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:09,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549327266] [2022-12-13 09:10:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:09,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:10:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:10,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549327266] [2022-12-13 09:10:10,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549327266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:10:10,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414956847] [2022-12-13 09:10:10,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:10,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:10:10,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:10:10,040 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:10:10,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 09:10:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:10,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:10:10,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:10:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:10:10,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:10:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:10:10,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414956847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:10:10,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:10:10,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:10:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779169929] [2022-12-13 09:10:10,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:10:10,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:10:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:10:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:10:10,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2022-12-13 09:10:10,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 699 transitions, 11107 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:10:10,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:10:10,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2022-12-13 09:10:10,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:10:21,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:23,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:33,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:35,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:37,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:39,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:41,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:44,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:46,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:48,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:51,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:54,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:58,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:00,695 INFO L130 PetriNetUnfolder]: 11303/19591 cut-off events. [2022-12-13 09:11:00,696 INFO L131 PetriNetUnfolder]: For 277797/277797 co-relation queries the response was YES. [2022-12-13 09:11:00,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122222 conditions, 19591 events. 11303/19591 cut-off events. For 277797/277797 co-relation queries the response was YES. Maximal size of possible extension queue 2344. Compared 173152 event pairs, 460 based on Foata normal form. 301/9528 useless extension candidates. Maximal degree in co-relation 122174. Up to 8381 conditions per place. [2022-12-13 09:11:00,790 INFO L137 encePairwiseOnDemand]: 16/49 looper letters, 367 selfloop transitions, 739 changer transitions 0/1110 dead transitions. [2022-12-13 09:11:00,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1110 transitions, 17624 flow [2022-12-13 09:11:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 09:11:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 09:11:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 505 transitions. [2022-12-13 09:11:00,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.429421768707483 [2022-12-13 09:11:00,792 INFO L175 Difference]: Start difference. First operand has 130 places, 699 transitions, 11107 flow. Second operand 24 states and 505 transitions. [2022-12-13 09:11:00,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 1110 transitions, 17624 flow [2022-12-13 09:11:04,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1110 transitions, 16917 flow, removed 274 selfloop flow, removed 6 redundant places. [2022-12-13 09:11:04,224 INFO L231 Difference]: Finished difference. Result has 156 places, 939 transitions, 16834 flow [2022-12-13 09:11:04,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10544, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=541, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=16834, PETRI_PLACES=156, PETRI_TRANSITIONS=939} [2022-12-13 09:11:04,225 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2022-12-13 09:11:04,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:11:04,225 INFO L89 Accepts]: Start accepts. Operand has 156 places, 939 transitions, 16834 flow [2022-12-13 09:11:04,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:11:04,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:11:04,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 939 transitions, 16834 flow [2022-12-13 09:11:04,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 939 transitions, 16834 flow [2022-12-13 09:11:04,970 INFO L130 PetriNetUnfolder]: 2757/6112 cut-off events. [2022-12-13 09:11:04,970 INFO L131 PetriNetUnfolder]: For 72901/73096 co-relation queries the response was YES. [2022-12-13 09:11:04,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48623 conditions, 6112 events. 2757/6112 cut-off events. For 72901/73096 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 61249 event pairs, 6 based on Foata normal form. 0/2093 useless extension candidates. Maximal degree in co-relation 48571. Up to 3182 conditions per place. [2022-12-13 09:11:05,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 939 transitions, 16834 flow [2022-12-13 09:11:05,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 8992 [2022-12-13 09:11:05,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 12)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 09:11:05,063 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111) (< v_~p~0_48 12)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:11:05,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (< v_~p~0_23 12) (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 09:11:05,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (< v_~p~0_44 12) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:11:05,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 12) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:11:05,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:11:05,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 12) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:11:05,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44)) (< v_~q~0_17 12)) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 09:11:05,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:11:05,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1128 [2022-12-13 09:11:05,353 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 939 transitions, 16914 flow [2022-12-13 09:11:05,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:11:05,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:11:05,354 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:11:05,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 09:11:05,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:05,558 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:11:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash -812160606, now seen corresponding path program 1 times [2022-12-13 09:11:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:05,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831401035] [2022-12-13 09:11:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:11:05,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831401035] [2022-12-13 09:11:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831401035] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:11:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553508402] [2022-12-13 09:11:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:05,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:11:05,663 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:11:05,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 09:11:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:05,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 09:11:05,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:11:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:11:05,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:11:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:11:06,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553508402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:11:06,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:11:06,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:11:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607124597] [2022-12-13 09:11:06,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:11:06,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:11:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:06,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:11:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:11:06,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 57 [2022-12-13 09:11:06,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 939 transitions, 16914 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:11:06,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:11:06,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 57 [2022-12-13 09:11:06,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:11:11,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:16,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:18,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:20,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:22,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:24,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:26,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:33,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:35,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:37,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:40,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:42,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:44,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:46,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:47,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:49,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:51,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:53,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:57,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:59,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:01,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:03,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:05,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:07,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:10,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:12,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:14,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:16,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:18,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:19,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:21,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:23,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:25,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:28,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:30,460 INFO L130 PetriNetUnfolder]: 11870/20678 cut-off events. [2022-12-13 09:12:30,460 INFO L131 PetriNetUnfolder]: For 362152/362152 co-relation queries the response was YES. [2022-12-13 09:12:30,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139210 conditions, 20678 events. 11870/20678 cut-off events. For 362152/362152 co-relation queries the response was YES. Maximal size of possible extension queue 2526. Compared 186058 event pairs, 1158 based on Foata normal form. 322/9923 useless extension candidates. Maximal degree in co-relation 139155. Up to 13748 conditions per place. [2022-12-13 09:12:30,564 INFO L137 encePairwiseOnDemand]: 16/57 looper letters, 668 selfloop transitions, 494 changer transitions 1/1167 dead transitions. [2022-12-13 09:12:30,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1167 transitions, 21025 flow [2022-12-13 09:12:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:12:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 09:12:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 399 transitions. [2022-12-13 09:12:30,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 09:12:30,565 INFO L175 Difference]: Start difference. First operand has 156 places, 939 transitions, 16914 flow. Second operand 18 states and 399 transitions. [2022-12-13 09:12:30,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 1167 transitions, 21025 flow [2022-12-13 09:12:35,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 1167 transitions, 19343 flow, removed 697 selfloop flow, removed 12 redundant places. [2022-12-13 09:12:35,521 INFO L231 Difference]: Finished difference. Result has 167 places, 1035 transitions, 18208 flow [2022-12-13 09:12:35,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=15252, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=18208, PETRI_PLACES=167, PETRI_TRANSITIONS=1035} [2022-12-13 09:12:35,522 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2022-12-13 09:12:35,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:12:35,522 INFO L89 Accepts]: Start accepts. Operand has 167 places, 1035 transitions, 18208 flow [2022-12-13 09:12:35,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:12:35,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:12:35,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 1035 transitions, 18208 flow [2022-12-13 09:12:35,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 1035 transitions, 18208 flow [2022-12-13 09:12:36,212 INFO L130 PetriNetUnfolder]: 2962/6557 cut-off events. [2022-12-13 09:12:36,212 INFO L131 PetriNetUnfolder]: For 80634/80820 co-relation queries the response was YES. [2022-12-13 09:12:36,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51483 conditions, 6557 events. 2962/6557 cut-off events. For 80634/80820 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 66335 event pairs, 6 based on Foata normal form. 0/2200 useless extension candidates. Maximal degree in co-relation 51427. Up to 3407 conditions per place. [2022-12-13 09:12:36,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 1035 transitions, 18208 flow [2022-12-13 09:12:36,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 9778 [2022-12-13 09:12:36,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111) (< v_~p~0_48 12)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:12:36,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (< v_~p~0_23 12) (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 09:12:36,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (< v_~p~0_44 12) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:12:36,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 12)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 09:12:36,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:12:36,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 12) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:12:36,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44)) (< v_~q~0_17 12)) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 09:12:36,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 12) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:12:36,632 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:12:36,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1111 [2022-12-13 09:12:36,633 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 1035 transitions, 18328 flow [2022-12-13 09:12:36,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:12:36,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:12:36,633 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:12:36,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 09:12:36,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:12:36,833 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:12:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:12:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash -281428480, now seen corresponding path program 1 times [2022-12-13 09:12:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:12:36,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966991193] [2022-12-13 09:12:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:12:36,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:12:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:12:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:12:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:12:36,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966991193] [2022-12-13 09:12:36,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966991193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:12:36,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411721812] [2022-12-13 09:12:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:12:36,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:12:36,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:12:36,935 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:12:36,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 09:12:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:12:37,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:12:37,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:12:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:12:37,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:12:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:12:37,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411721812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:12:37,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:12:37,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:12:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873380798] [2022-12-13 09:12:37,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:12:37,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:12:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:12:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:12:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:12:37,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 65 [2022-12-13 09:12:37,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 1035 transitions, 18328 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:12:37,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:12:37,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 65 [2022-12-13 09:12:37,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:12:53,880 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:12:56,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:12:58,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:02,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:05,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:08,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:10,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:12,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:13,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:15,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:17,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:19,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:21,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:23,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:24,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:27,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:31,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:34,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:36,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:38,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:40,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:42,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:45,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:48,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:49,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:51,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:53,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:55,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:57,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:59,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:01,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:03,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:05,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:10,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:15,489 INFO L130 PetriNetUnfolder]: 14263/24942 cut-off events. [2022-12-13 09:14:15,489 INFO L131 PetriNetUnfolder]: For 497400/497400 co-relation queries the response was YES. [2022-12-13 09:14:15,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171340 conditions, 24942 events. 14263/24942 cut-off events. For 497400/497400 co-relation queries the response was YES. Maximal size of possible extension queue 3093. Compared 232231 event pairs, 720 based on Foata normal form. 301/11824 useless extension candidates. Maximal degree in co-relation 171281. Up to 12332 conditions per place. [2022-12-13 09:14:15,642 INFO L137 encePairwiseOnDemand]: 16/65 looper letters, 512 selfloop transitions, 914 changer transitions 1/1431 dead transitions. [2022-12-13 09:14:15,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1431 transitions, 25570 flow [2022-12-13 09:14:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:14:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 09:14:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 538 transitions. [2022-12-13 09:14:15,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3310769230769231 [2022-12-13 09:14:15,653 INFO L175 Difference]: Start difference. First operand has 166 places, 1035 transitions, 18328 flow. Second operand 25 states and 538 transitions. [2022-12-13 09:14:15,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1431 transitions, 25570 flow [2022-12-13 09:14:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 1431 transitions, 24863 flow, removed 241 selfloop flow, removed 9 redundant places. [2022-12-13 09:14:24,656 INFO L231 Difference]: Finished difference. Result has 191 places, 1255 transitions, 24656 flow [2022-12-13 09:14:24,657 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=17621, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1035, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=709, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=24656, PETRI_PLACES=191, PETRI_TRANSITIONS=1255} [2022-12-13 09:14:24,657 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2022-12-13 09:14:24,657 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:14:24,657 INFO L89 Accepts]: Start accepts. Operand has 191 places, 1255 transitions, 24656 flow [2022-12-13 09:14:24,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:14:24,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:14:24,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 1255 transitions, 24656 flow [2022-12-13 09:14:24,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 1255 transitions, 24656 flow [2022-12-13 09:14:25,755 INFO L130 PetriNetUnfolder]: 3570/7881 cut-off events. [2022-12-13 09:14:25,756 INFO L131 PetriNetUnfolder]: For 144970/145156 co-relation queries the response was YES. [2022-12-13 09:14:25,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70140 conditions, 7881 events. 3570/7881 cut-off events. For 144970/145156 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 81731 event pairs, 6 based on Foata normal form. 0/2690 useless extension candidates. Maximal degree in co-relation 70073. Up to 4415 conditions per place. [2022-12-13 09:14:25,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 1255 transitions, 24656 flow [2022-12-13 09:14:25,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 11714 [2022-12-13 09:14:25,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 12) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:14:25,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 12) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:14:25,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 12) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 09:14:25,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44)) (< v_~q~0_17 12)) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 09:14:25,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 12)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 09:14:26,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111) (< v_~p~0_48 12)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:14:26,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (< v_~p~0_23 12) (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 09:14:26,112 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [361] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (* 75025 v_~prev~0_218) (+ v_~prev~0_220 v_~cur~0_194 (* 46368 v_~next~0_127))) (= (* 75025 v_~next~0_127) (+ v_~cur~0_194 (* 121393 v_~prev~0_218)))) InVars {~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_218, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (< v_~p~0_44 12) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 09:14:26,187 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:14:26,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1530 [2022-12-13 09:14:26,187 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 1255 transitions, 24752 flow [2022-12-13 09:14:26,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:14:26,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:14:26,188 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:14:26,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 09:14:26,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 09:14:26,388 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:14:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:14:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash -216569629, now seen corresponding path program 1 times [2022-12-13 09:14:26,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:14:26,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77552088] [2022-12-13 09:14:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:14:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:14:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:14:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:14:26,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:14:26,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77552088] [2022-12-13 09:14:26,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77552088] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:14:26,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900982513] [2022-12-13 09:14:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:14:26,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:14:26,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:14:26,498 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:14:26,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 09:14:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:14:26,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 09:14:26,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:14:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:14:26,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:14:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:14:26,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900982513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:14:26,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:14:26,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:14:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454934315] [2022-12-13 09:14:26,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:14:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:14:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:14:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:14:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:14:26,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 73 [2022-12-13 09:14:26,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 1255 transitions, 24752 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:14:26,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:14:26,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 73 [2022-12-13 09:14:26,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:14:29,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:31,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:34,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:36,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:39,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:41,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:43,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:46,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:52,440 INFO L130 PetriNetUnfolder]: 15624/27793 cut-off events. [2022-12-13 09:14:52,441 INFO L131 PetriNetUnfolder]: For 784963/784963 co-relation queries the response was YES. [2022-12-13 09:14:52,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208041 conditions, 27793 events. 15624/27793 cut-off events. For 784963/784963 co-relation queries the response was YES. Maximal size of possible extension queue 3605. Compared 268716 event pairs, 2863 based on Foata normal form. 462/13014 useless extension candidates. Maximal degree in co-relation 207971. Up to 21557 conditions per place. [2022-12-13 09:14:52,768 INFO L137 encePairwiseOnDemand]: 41/73 looper letters, 1092 selfloop transitions, 474 changer transitions 7/1577 dead transitions. [2022-12-13 09:14:52,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1577 transitions, 32506 flow [2022-12-13 09:14:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:14:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 09:14:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 319 transitions. [2022-12-13 09:14:52,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.312133072407045 [2022-12-13 09:14:52,769 INFO L175 Difference]: Start difference. First operand has 190 places, 1255 transitions, 24752 flow. Second operand 14 states and 319 transitions. [2022-12-13 09:14:52,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1577 transitions, 32506 flow [2022-12-13 09:15:05,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 1577 transitions, 30741 flow, removed 762 selfloop flow, removed 9 redundant places. [2022-12-13 09:15:05,806 INFO L231 Difference]: Finished difference. Result has 200 places, 1476 transitions, 29236 flow [2022-12-13 09:15:05,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=23037, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=822, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=29236, PETRI_PLACES=200, PETRI_TRANSITIONS=1476} [2022-12-13 09:15:05,807 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2022-12-13 09:15:05,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:15:05,807 INFO L89 Accepts]: Start accepts. Operand has 200 places, 1476 transitions, 29236 flow [2022-12-13 09:15:05,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:15:05,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:15:05,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 1476 transitions, 29236 flow [2022-12-13 09:15:05,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 1476 transitions, 29236 flow [2022-12-13 09:15:07,335 INFO L130 PetriNetUnfolder]: 4141/9268 cut-off events. [2022-12-13 09:15:07,335 INFO L131 PetriNetUnfolder]: For 180279/180449 co-relation queries the response was YES. [2022-12-13 09:15:07,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82209 conditions, 9268 events. 4141/9268 cut-off events. For 180279/180449 co-relation queries the response was YES. Maximal size of possible extension queue 1713. Compared 99706 event pairs, 24 based on Foata normal form. 0/3073 useless extension candidates. Maximal degree in co-relation 82136. Up to 5320 conditions per place. [2022-12-13 09:15:07,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 1476 transitions, 29236 flow [2022-12-13 09:15:07,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 13530 [2022-12-13 09:15:07,452 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:15:07,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1645 [2022-12-13 09:15:07,452 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 1476 transitions, 29236 flow [2022-12-13 09:15:07,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:15:07,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:15:07,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:15:07,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 09:15:07,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 09:15:07,662 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:15:07,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:15:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash -281227042, now seen corresponding path program 1 times [2022-12-13 09:15:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:15:07,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493751273] [2022-12-13 09:15:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:15:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:15:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:15:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:15:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:15:07,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493751273] [2022-12-13 09:15:07,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493751273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:15:07,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217926699] [2022-12-13 09:15:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:15:07,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:15:07,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:15:07,804 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:15:07,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 09:15:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:15:07,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 09:15:07,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:15:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:15:07,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:15:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:15:08,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217926699] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:15:08,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:15:08,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:15:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128214893] [2022-12-13 09:15:08,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:15:08,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:15:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:15:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:15:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:15:08,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 73 [2022-12-13 09:15:08,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 1476 transitions, 29236 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:15:08,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:15:08,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 73 [2022-12-13 09:15:08,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:15:19,136 WARN L233 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 63 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:15:22,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:24,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:26,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:29,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:31,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:33,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:36,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:38,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:40,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:42,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:44,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:15:46,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-13 09:15:46,961 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 09:15:46,961 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 09:15:47,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 09:15:48,161 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 09:15:48,172 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 09:15:48,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 09:15:48,173 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-13 09:15:48,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 09:15:48,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 09:15:48,174 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:15:48,176 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:15:48,177 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:15:48,177 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 137 [2022-12-13 09:15:48,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:15:48 BasicIcfg [2022-12-13 09:15:48,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:15:48,179 INFO L158 Benchmark]: Toolchain (without parser) took 866118.22ms. Allocated memory was 202.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 176.5MB in the beginning and 648.7MB in the end (delta: -472.2MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-13 09:15:48,179 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory is still 179.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:15:48,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.70ms. Allocated memory is still 202.4MB. Free memory was 176.5MB in the beginning and 156.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 09:15:48,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.91ms. Allocated memory is still 202.4MB. Free memory was 156.2MB in the beginning and 154.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:15:48,180 INFO L158 Benchmark]: Boogie Preprocessor took 22.09ms. Allocated memory is still 202.4MB. Free memory was 154.1MB in the beginning and 152.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:15:48,180 INFO L158 Benchmark]: RCFGBuilder took 328.89ms. Allocated memory is still 202.4MB. Free memory was 152.7MB in the beginning and 139.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 09:15:48,181 INFO L158 Benchmark]: TraceAbstraction took 865312.09ms. Allocated memory was 202.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 138.0MB in the beginning and 648.7MB in the end (delta: -510.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-13 09:15:48,181 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.11ms. Allocated memory is still 202.4MB. Free memory is still 179.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.70ms. Allocated memory is still 202.4MB. Free memory was 176.5MB in the beginning and 156.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.91ms. Allocated memory is still 202.4MB. Free memory was 156.2MB in the beginning and 154.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.09ms. Allocated memory is still 202.4MB. Free memory was 154.1MB in the beginning and 152.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 328.89ms. Allocated memory is still 202.4MB. Free memory was 152.7MB in the beginning and 139.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 865312.09ms. Allocated memory was 202.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 138.0MB in the beginning and 648.7MB in the end (delta: -510.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 91 PlacesBefore, 32 PlacesAfterwards, 91 TransitionsBefore, 28 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 6 ChoiceCompositions, 79 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 1655, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1451, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1451, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1451, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1670, independent: 215, independent conditional: 215, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1451, unknown conditional: 1451, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1673, Positive cache size: 1662, Positive conditional cache size: 1662, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 140, Positive conditional cache size: 140, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 300, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 540, Positive conditional cache size: 540, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 740, Positive conditional cache size: 740, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 820, Positive cache size: 820, Positive conditional cache size: 820, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1000, Positive cache size: 1000, Positive conditional cache size: 1000, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1200, Positive conditional cache size: 1200, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1420, Positive cache size: 1420, Positive conditional cache size: 1420, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1660, Positive cache size: 1660, Positive conditional cache size: 1660, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1920, Positive cache size: 1920, Positive conditional cache size: 1920, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1960, Positive cache size: 1960, Positive conditional cache size: 1960, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 41 PlacesBefore, 41 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 216, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2024, Positive cache size: 2024, Positive conditional cache size: 2024, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2024, Positive cache size: 2024, Positive conditional cache size: 2024, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 1940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2024, Positive cache size: 2024, Positive conditional cache size: 2024, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 1632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2024, Positive cache size: 2024, Positive conditional cache size: 2024, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 229 TransitionsBefore, 229 TransitionsAfterwards, 2488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2024, Positive cache size: 2024, Positive conditional cache size: 2024, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 306 TransitionsBefore, 306 TransitionsAfterwards, 3424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2024, Positive cache size: 2024, Positive conditional cache size: 2024, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 386 TransitionsBefore, 386 TransitionsAfterwards, 4064 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2024, Positive cache size: 2024, Positive conditional cache size: 2024, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 106 PlacesBefore, 105 PlacesAfterwards, 455 TransitionsBefore, 454 TransitionsAfterwards, 4656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 86, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2042, Positive cache size: 2042, Positive conditional cache size: 2042, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 554 TransitionsBefore, 554 TransitionsAfterwards, 5372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2042, Positive cache size: 2042, Positive conditional cache size: 2042, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 125 PlacesBefore, 124 PlacesAfterwards, 553 TransitionsBefore, 552 TransitionsAfterwards, 5358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2046, Positive cache size: 2046, Positive conditional cache size: 2046, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 130 PlacesBefore, 130 PlacesAfterwards, 699 TransitionsBefore, 699 TransitionsAfterwards, 6788 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2046, Positive cache size: 2046, Positive conditional cache size: 2046, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 156 PlacesBefore, 156 PlacesAfterwards, 939 TransitionsBefore, 939 TransitionsAfterwards, 8992 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 80, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2056, Positive cache size: 2056, Positive conditional cache size: 2056, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 166 PlacesBefore, 166 PlacesAfterwards, 1035 TransitionsBefore, 1035 TransitionsAfterwards, 9778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 64, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2064, Positive cache size: 2064, Positive conditional cache size: 2064, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 190 PlacesBefore, 190 PlacesAfterwards, 1255 TransitionsBefore, 1255 TransitionsAfterwards, 11714 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 80, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2074, Positive cache size: 2074, Positive conditional cache size: 2074, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 199 PlacesBefore, 199 PlacesAfterwards, 1476 TransitionsBefore, 1476 TransitionsAfterwards, 13530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 2074, Positive cache size: 2074, Positive conditional cache size: 2074, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 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: 865.2s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 834.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 231 mSolverCounterUnknown, 4215 SdHoareTripleChecker+Valid, 629.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4215 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 625.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10324 IncrementalHoareTripleChecker+Invalid, 13888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3332 mSolverCounterUnsat, 0 mSDtfsCounter, 10324 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 148.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29236occurred in iteration=27, InterpolantAutomatonStates: 275, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 630 ConstructedInterpolants, 109 QuantifiedInterpolants, 10929 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3759 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 79 InterpolantComputations, 3 PerfectInterpolantSequences, 6/130 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown