/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:04:47,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:04:47,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:04:47,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:04:47,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:04:47,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:04:47,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:04:47,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:04:47,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:04:47,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:04:47,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:04:47,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:04:47,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:04:47,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:04:47,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:04:47,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:04:47,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:04:47,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:04:47,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:04:47,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:04:47,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:04:47,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:04:47,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:04:47,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:04:47,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:04:47,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:04:47,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:04:47,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:04:47,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:04:47,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:04:47,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:04:47,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:04:47,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:04:47,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:04:47,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:04:47,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:04:47,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:04:47,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:04:47,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:04:47,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:04:47,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:04:47,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 02:04:47,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:04:47,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:04:47,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:04:47,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:04:47,492 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:04:47,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:04:47,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:04:47,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:04:47,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:04:47,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:04:47,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:04:47,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:04:47,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:04:47,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:04:47,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:04:47,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:04:47,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:04:47,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:04:47,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:04:47,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:04:47,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:04:47,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:04:47,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:04:47,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:04:47,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:04:47,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:04:47,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:04:47,496 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:04:47,497 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 02:04:47,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:04:47,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:04:47,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:04:47,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:04:47,812 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:04:47,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-12-13 02:04:49,061 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:04:49,302 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:04:49,302 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-12-13 02:04:49,307 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cafc8add/66448b1732314c5d9229b793d7549d9f/FLAG70eb42cdd [2022-12-13 02:04:49,317 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cafc8add/66448b1732314c5d9229b793d7549d9f [2022-12-13 02:04:49,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:04:49,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:04:49,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:04:49,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:04:49,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:04:49,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681dcacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49, skipping insertion in model container [2022-12-13 02:04:49,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:04:49,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:04:49,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,477 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-12-13 02:04:49,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:04:49,491 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:04:49,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:04:49,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:04:49,521 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-12-13 02:04:49,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:04:49,544 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:04:49,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49 WrapperNode [2022-12-13 02:04:49,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:04:49,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:04:49,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:04:49,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:04:49,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,604 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-12-13 02:04:49,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:04:49,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:04:49,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:04:49,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:04:49,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:04:49,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:04:49,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:04:49,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:04:49,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (1/1) ... [2022-12-13 02:04:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:04:49,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:04:49,687 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 02:04:49,696 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 02:04:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:04:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:04:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:04:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:04:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:04:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:04:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:04:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:04:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 02:04:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 02:04:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 02:04:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 02:04:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:04:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 02:04:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 02:04:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:04:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:04:49,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:04:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:04:49,728 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 02:04:49,849 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:04:49,851 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:04:50,134 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:04:50,217 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:04:50,217 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 02:04:50,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:04:50 BoogieIcfgContainer [2022-12-13 02:04:50,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:04:50,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:04:50,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:04:50,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:04:50,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:04:49" (1/3) ... [2022-12-13 02:04:50,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4cd1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:04:50, skipping insertion in model container [2022-12-13 02:04:50,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:04:49" (2/3) ... [2022-12-13 02:04:50,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4cd1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:04:50, skipping insertion in model container [2022-12-13 02:04:50,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:04:50" (3/3) ... [2022-12-13 02:04:50,226 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-12-13 02:04:50,242 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:04:50,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:04:50,242 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:04:50,345 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 02:04:50,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 352 flow [2022-12-13 02:04:50,469 INFO L130 PetriNetUnfolder]: 12/156 cut-off events. [2022-12-13 02:04:50,470 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 02:04:50,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 12/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-13 02:04:50,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 352 flow [2022-12-13 02:04:50,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 312 flow [2022-12-13 02:04:50,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:50,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-13 02:04:50,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-13 02:04:50,540 INFO L130 PetriNetUnfolder]: 12/144 cut-off events. [2022-12-13 02:04:50,540 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 02:04:50,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 144 events. 12/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-13 02:04:50,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-13 02:04:50,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-13 02:04:56,691 INFO L241 LiptonReduction]: Total number of compositions: 113 [2022-12-13 02:04:56,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:04:56,729 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;@2413ef31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:04:56,730 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 02:04:56,744 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-13 02:04:56,744 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 02:04:56,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:56,745 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:04:56,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:04:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1695043003, now seen corresponding path program 1 times [2022-12-13 02:04:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:56,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267895060] [2022-12-13 02:04:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:57,176 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 02:04:57,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267895060] [2022-12-13 02:04:57,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267895060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:57,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:57,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:57,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652826473] [2022-12-13 02:04:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:57,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:04:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:57,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:04:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:04:57,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 02:04:57,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:57,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 02:04:57,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:57,529 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2022-12-13 02:04:57,529 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 02:04:57,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7133 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2022-12-13 02:04:57,544 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-13 02:04:57,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2022-12-13 02:04:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:04:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:04:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-13 02:04:57,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2022-12-13 02:04:57,555 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 50 transitions. [2022-12-13 02:04:57,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2022-12-13 02:04:57,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 02:04:57,562 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2022-12-13 02:04:57,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-13 02:04:57,567 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-13 02:04:57,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:57,568 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 84 flow [2022-12-13 02:04:57,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:57,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:57,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-13 02:04:57,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 84 flow [2022-12-13 02:04:57,577 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-13 02:04:57,577 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:04:57,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 4/32 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2022-12-13 02:04:57,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-13 02:04:57,579 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 02:04:57,603 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:04:57,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 02:04:57,604 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2022-12-13 02:04:57,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:57,605 INFO L214 CegarLoopForPetriNet]: trace 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 02:04:57,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:04:57,605 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:04:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1731643137, now seen corresponding path program 1 times [2022-12-13 02:04:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:57,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471256706] [2022-12-13 02:04:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:04:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:57,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471256706] [2022-12-13 02:04:57,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471256706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:57,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:57,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:57,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358828000] [2022-12-13 02:04:57,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:57,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:04:57,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:57,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:04:57,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:04:57,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:04:57,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:57,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:04:57,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:58,006 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2022-12-13 02:04:58,007 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-12-13 02:04:58,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8137 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2022-12-13 02:04:58,019 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-13 02:04:58,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2022-12-13 02:04:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:04:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:04:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 02:04:58,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2022-12-13 02:04:58,021 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 49 transitions. [2022-12-13 02:04:58,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2022-12-13 02:04:58,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 02:04:58,023 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,023 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-13 02:04:58,024 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-13 02:04:58,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:58,024 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:58,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:58,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,030 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-13 02:04:58,031 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:04:58,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-13 02:04:58,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 02:04:58,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:58,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:04:58,127 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 88 flow [2022-12-13 02:04:58,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:58,128 INFO L214 CegarLoopForPetriNet]: trace 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 02:04:58,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:04:58,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:04:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1115120276, now seen corresponding path program 1 times [2022-12-13 02:04:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:58,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030366503] [2022-12-13 02:04:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:04:58,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:58,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030366503] [2022-12-13 02:04:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030366503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:58,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:58,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349287474] [2022-12-13 02:04:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:58,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:04:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:58,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:04:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:04:58,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:04:58,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:58,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:04:58,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:58,517 INFO L130 PetriNetUnfolder]: 1632/2222 cut-off events. [2022-12-13 02:04:58,517 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-13 02:04:58,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 2222 events. 1632/2222 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7613 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 1664. Up to 1790 conditions per place. [2022-12-13 02:04:58,530 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2022-12-13 02:04:58,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 237 flow [2022-12-13 02:04:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:04:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:04:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 02:04:58,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-13 02:04:58,532 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 88 flow. Second operand 4 states and 48 transitions. [2022-12-13 02:04:58,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 237 flow [2022-12-13 02:04:58,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 02:04:58,536 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-13 02:04:58,537 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-13 02:04:58,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:58,538 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:58,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:58,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,545 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-13 02:04:58,548 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:04:58,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-13 02:04:58,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-13 02:04:58,566 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:04:58,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 02:04:58,568 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2022-12-13 02:04:58,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:58,568 INFO L214 CegarLoopForPetriNet]: trace 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, 1] [2022-12-13 02:04:58,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:04:58,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:04:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1272676707, now seen corresponding path program 1 times [2022-12-13 02:04:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:58,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202470672] [2022-12-13 02:04:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 02:04:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:58,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202470672] [2022-12-13 02:04:58,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202470672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:58,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:58,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:04:58,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339789209] [2022-12-13 02:04:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:58,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:04:58,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:58,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:04:58,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:04:58,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:04:58,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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 02:04:58,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:58,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:04:58,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:58,929 INFO L130 PetriNetUnfolder]: 1632/2223 cut-off events. [2022-12-13 02:04:58,929 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-13 02:04:58,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 2223 events. 1632/2223 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7381 event pairs, 1243 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 1727. Up to 2223 conditions per place. [2022-12-13 02:04:58,941 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-13 02:04:58,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 162 flow [2022-12-13 02:04:58,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:04:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:04:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-13 02:04:58,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 02:04:58,943 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 3 states and 33 transitions. [2022-12-13 02:04:58,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 162 flow [2022-12-13 02:04:58,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 02:04:58,946 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 98 flow [2022-12-13 02:04:58,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-13 02:04:58,948 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2022-12-13 02:04:58,948 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:58,948 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 98 flow [2022-12-13 02:04:58,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:58,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:58,949 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-13 02:04:58,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 98 flow [2022-12-13 02:04:58,954 INFO L130 PetriNetUnfolder]: 4/34 cut-off events. [2022-12-13 02:04:58,954 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:04:58,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 34 events. 4/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2022-12-13 02:04:58,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-13 02:04:58,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-13 02:05:00,244 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:00,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1297 [2022-12-13 02:05:00,245 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 94 flow [2022-12-13 02:05:00,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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 02:05:00,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:00,246 INFO L214 CegarLoopForPetriNet]: trace 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, 1] [2022-12-13 02:05:00,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:05:00,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:05:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash -922744889, now seen corresponding path program 1 times [2022-12-13 02:05:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:00,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091194738] [2022-12-13 02:05:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:05:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:01,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091194738] [2022-12-13 02:05:01,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091194738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:05:01,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037671573] [2022-12-13 02:05:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:05:01,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:05:01,279 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 02:05:01,310 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 02:05:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:01,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 02:05:01,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:05:01,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 02:05:01,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:05:01,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:05:01,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:05:01,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:05:01,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:05:01,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:05:01,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-13 02:05:01,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-12-13 02:05:01,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2022-12-13 02:05:02,032 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 02:05:02,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:05:02,571 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_186 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< c_~min~0 (+ 3 .cse0))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-12-13 02:05:02,896 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< c_~min~0 (+ 3 .cse0))))) (not (< c_~min~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 3 .cse3)) (< 2147483645 .cse3))))))))) is different from false [2022-12-13 02:05:02,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< .cse1 (+ 3 .cse0))))) (not (< .cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse3 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< .cse3 (+ 3 .cse4)) (< 2147483645 .cse4)))) (< .cse1 .cse3))))))) is different from false [2022-12-13 02:05:03,000 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse0) (< .cse1 (+ .cse0 3))))) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse1)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (not (< .cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse6) (< .cse4 (+ .cse6 3)))))))))) is different from false [2022-12-13 02:05:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:03,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037671573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:05:03,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:05:03,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 33 [2022-12-13 02:05:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775898570] [2022-12-13 02:05:03,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:05:03,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 02:05:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 02:05:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=785, Unknown=17, NotChecked=244, Total=1190 [2022-12-13 02:05:03,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:05:03,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 94 flow. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 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 02:05:03,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:03,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:05:03,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:28,000 WARN L233 SmtUtils]: Spent 24.17s on a formula simplification. DAG size of input: 76 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:05:52,502 WARN L233 SmtUtils]: Spent 24.21s on a formula simplification. DAG size of input: 79 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:06:17,172 WARN L233 SmtUtils]: Spent 24.14s on a formula simplification. DAG size of input: 77 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:06:41,802 WARN L233 SmtUtils]: Spent 24.19s on a formula simplification. DAG size of input: 116 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:07:07,458 WARN L233 SmtUtils]: Spent 24.15s on a formula simplification. DAG size of input: 78 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:07:32,026 WARN L233 SmtUtils]: Spent 24.14s on a formula simplification. DAG size of input: 81 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:07:56,278 WARN L233 SmtUtils]: Spent 24.20s on a formula simplification. DAG size of input: 118 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:08:21,035 WARN L233 SmtUtils]: Spent 24.17s on a formula simplification. DAG size of input: 79 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:08:22,293 INFO L130 PetriNetUnfolder]: 9477/13080 cut-off events. [2022-12-13 02:08:22,293 INFO L131 PetriNetUnfolder]: For 2097/2097 co-relation queries the response was YES. [2022-12-13 02:08:22,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30946 conditions, 13080 events. 9477/13080 cut-off events. For 2097/2097 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 66326 event pairs, 64 based on Foata normal form. 8/10244 useless extension candidates. Maximal degree in co-relation 30936. Up to 2563 conditions per place. [2022-12-13 02:08:22,342 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 270 selfloop transitions, 77 changer transitions 329/676 dead transitions. [2022-12-13 02:08:22,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 676 transitions, 3140 flow [2022-12-13 02:08:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 02:08:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-13 02:08:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 654 transitions. [2022-12-13 02:08:22,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41366223908918404 [2022-12-13 02:08:22,346 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 94 flow. Second operand 51 states and 654 transitions. [2022-12-13 02:08:22,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 676 transitions, 3140 flow [2022-12-13 02:08:22,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 676 transitions, 3128 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 02:08:22,441 INFO L231 Difference]: Finished difference. Result has 122 places, 132 transitions, 765 flow [2022-12-13 02:08:22,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=765, PETRI_PLACES=122, PETRI_TRANSITIONS=132} [2022-12-13 02:08:22,442 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 82 predicate places. [2022-12-13 02:08:22,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:22,442 INFO L89 Accepts]: Start accepts. Operand has 122 places, 132 transitions, 765 flow [2022-12-13 02:08:22,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:22,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:22,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 132 transitions, 765 flow [2022-12-13 02:08:22,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 132 transitions, 765 flow [2022-12-13 02:08:22,514 INFO L130 PetriNetUnfolder]: 320/776 cut-off events. [2022-12-13 02:08:22,514 INFO L131 PetriNetUnfolder]: For 4456/4617 co-relation queries the response was YES. [2022-12-13 02:08:22,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 776 events. 320/776 cut-off events. For 4456/4617 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4710 event pairs, 5 based on Foata normal form. 3/755 useless extension candidates. Maximal degree in co-relation 2399. Up to 168 conditions per place. [2022-12-13 02:08:22,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 132 transitions, 765 flow [2022-12-13 02:08:22,527 INFO L226 LiptonReduction]: Number of co-enabled transitions 1658 [2022-12-13 02:08:26,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:26,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 02:08:26,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:26,422 WARN L322 ript$VariableManager]: TermVariable LBE276 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:26,423 WARN L322 ript$VariableManager]: TermVariable LBE271 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:26,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 02:08:26,778 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:08:26,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4337 [2022-12-13 02:08:26,779 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 131 transitions, 787 flow [2022-12-13 02:08:26,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 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 02:08:26,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:26,780 INFO L214 CegarLoopForPetriNet]: trace 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 02:08:26,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 02:08:26,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:26,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1245019757, now seen corresponding path program 1 times [2022-12-13 02:08:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:26,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975177438] [2022-12-13 02:08:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:26,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 02:08:27,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:27,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975177438] [2022-12-13 02:08:27,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975177438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:27,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:27,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:08:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537388490] [2022-12-13 02:08:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:27,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:08:27,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 131 transitions, 787 flow. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:27,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:27,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:08:27,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:28,919 INFO L130 PetriNetUnfolder]: 8456/11860 cut-off events. [2022-12-13 02:08:28,920 INFO L131 PetriNetUnfolder]: For 105227/105227 co-relation queries the response was YES. [2022-12-13 02:08:29,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50217 conditions, 11860 events. 8456/11860 cut-off events. For 105227/105227 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 60315 event pairs, 1632 based on Foata normal form. 8/11840 useless extension candidates. Maximal degree in co-relation 50162. Up to 7837 conditions per place. [2022-12-13 02:08:29,100 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 130 selfloop transitions, 8 changer transitions 140/278 dead transitions. [2022-12-13 02:08:29,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 278 transitions, 2249 flow [2022-12-13 02:08:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 02:08:29,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45789473684210524 [2022-12-13 02:08:29,104 INFO L175 Difference]: Start difference. First operand has 97 places, 131 transitions, 787 flow. Second operand 5 states and 87 transitions. [2022-12-13 02:08:29,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 278 transitions, 2249 flow [2022-12-13 02:08:29,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 278 transitions, 2123 flow, removed 62 selfloop flow, removed 18 redundant places. [2022-12-13 02:08:29,593 INFO L231 Difference]: Finished difference. Result has 85 places, 122 transitions, 700 flow [2022-12-13 02:08:29,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=700, PETRI_PLACES=85, PETRI_TRANSITIONS=122} [2022-12-13 02:08:29,594 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 45 predicate places. [2022-12-13 02:08:29,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:29,594 INFO L89 Accepts]: Start accepts. Operand has 85 places, 122 transitions, 700 flow [2022-12-13 02:08:29,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:29,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:29,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 122 transitions, 700 flow [2022-12-13 02:08:29,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 122 transitions, 700 flow [2022-12-13 02:08:29,651 INFO L130 PetriNetUnfolder]: 252/631 cut-off events. [2022-12-13 02:08:29,652 INFO L131 PetriNetUnfolder]: For 1960/2054 co-relation queries the response was YES. [2022-12-13 02:08:29,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 631 events. 252/631 cut-off events. For 1960/2054 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3641 event pairs, 2 based on Foata normal form. 4/601 useless extension candidates. Maximal degree in co-relation 1646. Up to 126 conditions per place. [2022-12-13 02:08:29,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 122 transitions, 700 flow [2022-12-13 02:08:29,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 1498 [2022-12-13 02:08:29,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] [2022-12-13 02:08:29,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:29,810 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:29,860 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:29,861 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-13 02:08:29,861 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 121 transitions, 711 flow [2022-12-13 02:08:29,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:29,861 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:29,861 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:29,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:08:29,861 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -158025881, now seen corresponding path program 1 times [2022-12-13 02:08:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077035882] [2022-12-13 02:08:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077035882] [2022-12-13 02:08:30,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077035882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:30,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:30,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:08:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036106504] [2022-12-13 02:08:30,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:30,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:30,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:30,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:30,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:30,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:08:30,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 121 transitions, 711 flow. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:30,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:30,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:08:30,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:30,974 INFO L130 PetriNetUnfolder]: 6174/8634 cut-off events. [2022-12-13 02:08:30,974 INFO L131 PetriNetUnfolder]: For 54796/54796 co-relation queries the response was YES. [2022-12-13 02:08:30,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33554 conditions, 8634 events. 6174/8634 cut-off events. For 54796/54796 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 41149 event pairs, 1414 based on Foata normal form. 6/8536 useless extension candidates. Maximal degree in co-relation 33516. Up to 5705 conditions per place. [2022-12-13 02:08:31,010 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 97 selfloop transitions, 11 changer transitions 152/260 dead transitions. [2022-12-13 02:08:31,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 260 transitions, 1980 flow [2022-12-13 02:08:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 02:08:31,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-13 02:08:31,012 INFO L175 Difference]: Start difference. First operand has 80 places, 121 transitions, 711 flow. Second operand 5 states and 90 transitions. [2022-12-13 02:08:31,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 260 transitions, 1980 flow [2022-12-13 02:08:31,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 260 transitions, 1916 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-13 02:08:31,158 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 459 flow [2022-12-13 02:08:31,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2022-12-13 02:08:31,159 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2022-12-13 02:08:31,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:31,160 INFO L89 Accepts]: Start accepts. Operand has 78 places, 82 transitions, 459 flow [2022-12-13 02:08:31,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:31,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:31,162 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 82 transitions, 459 flow [2022-12-13 02:08:31,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 82 transitions, 459 flow [2022-12-13 02:08:31,193 INFO L130 PetriNetUnfolder]: 109/290 cut-off events. [2022-12-13 02:08:31,194 INFO L131 PetriNetUnfolder]: For 1161/1192 co-relation queries the response was YES. [2022-12-13 02:08:31,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 290 events. 109/290 cut-off events. For 1161/1192 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1363 event pairs, 2 based on Foata normal form. 2/276 useless extension candidates. Maximal degree in co-relation 812. Up to 58 conditions per place. [2022-12-13 02:08:31,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 82 transitions, 459 flow [2022-12-13 02:08:31,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 02:08:31,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] $Ultimate##0-->L50: Formula: (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, ~min~0] and [644] L68-->L56-4: Formula: (and (= v_~b2~0_102 1) (= v_thread2Thread1of1ForFork3_~i~1_88 0) (= v_~b1~0_95 1) (= v_thread1Thread1of1ForFork1_~i~0_143 0)) InVars {} OutVars{~b2~0=v_~b2~0_102, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_88, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_143, ~b1~0=v_~b1~0_95} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1, thread1Thread1of1ForFork1_~i~0, ~b1~0] [2022-12-13 02:08:31,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] $Ultimate##0-->L50: Formula: (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, ~min~0] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:31,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] $Ultimate##0-->L50: Formula: (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, ~min~0] and [646] L68-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_390| v_~A~0.base_203)) (.cse2 (+ v_~A~0.offset_203 (* |v_thread3Thread1of1ForFork0_~i~2#1_68| 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= (+ |v_thread3Thread1of1ForFork0_~i~2#1_68| 1) |v_thread3Thread1of1ForFork0_~i~2#1_67|) (< |v_thread3Thread1of1ForFork0_~i~2#1_68| v_~N~0_160) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|) (= v_thread2Thread1of1ForFork3_~i~1_92 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (< .cse0 2147483647) 1 0)) (= |v_#memory_int_389| (store |v_#memory_int_390| v_~A~0.base_203 (store .cse1 .cse2 (+ .cse0 1)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= v_~b2~0_106 1)))) InVars {~A~0.base=v_~A~0.base_203, ~A~0.offset=v_~A~0.offset_203, #memory_int=|v_#memory_int_390|, ~N~0=v_~N~0_160, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_68|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_41|, ~A~0.base=v_~A~0.base_203, ~b2~0=v_~b2~0_106, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~N~0=v_~N~0_160, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_67|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_41|, ~A~0.offset=v_~A~0.offset_203, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_92, #memory_int=|v_#memory_int_389|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_45|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_41|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, ~b2~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_~i~1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:31,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] $Ultimate##0-->L50: Formula: (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, ~min~0] and [643] L68-->L74-4: Formula: (and (= v_~b2~0_100 1) (= v_thread2Thread1of1ForFork3_~i~1_84 1) (let ((.cse1 (select (select |v_#memory_int_383| v_~A~0.base_199) v_~A~0.offset_199))) (let ((.cse0 (< .cse1 v_~max~0_152))) (or (and (not .cse0) (= v_~max~0_151 |v_thread2_#t~mem9_53|) (= |v_thread2_#t~mem9_53| .cse1)) (and (= v_~max~0_151 v_~max~0_152) .cse0 (= |v_thread2_#t~mem9_53| |v_thread2Thread1of1ForFork3_#t~mem9_44|))))) (< 0 v_~N~0_156)) InVars {~A~0.base=v_~A~0.base_199, ~A~0.offset=v_~A~0.offset_199, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_44|, #memory_int=|v_#memory_int_383|, ~max~0=v_~max~0_152, ~N~0=v_~N~0_156} OutVars{~A~0.base=v_~A~0.base_199, ~b2~0=v_~b2~0_100, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_25|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_84, ~A~0.offset=v_~A~0.offset_199, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_33|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_25|, #memory_int=|v_#memory_int_383|, ~max~0=v_~max~0_151, ~N~0=v_~N~0_156} AuxVars[|v_thread2_#t~mem9_53|] AssignedVars[~b2~0, thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 02:08:31,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] $Ultimate##0-->L50: Formula: (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, ~min~0] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:31,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] $Ultimate##0-->L50: Formula: (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, ~min~0] and [645] L68-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_386| v_~A~0.base_201)) (.cse2 (+ v_~A~0.offset_201 (- 4) (* |v_thread3Thread1of1ForFork0_~i~2#1_65| 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39| (ite (< .cse0 2147483647) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_65| (+ v_~N~0_158 1)) (= v_thread2Thread1of1ForFork3_~i~1_90 0) (= |v_thread3Thread1of1ForFork0_~i~2#1_65| 1) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_39| 0)) (= |v_#memory_int_385| (store |v_#memory_int_386| v_~A~0.base_201 (store .cse1 .cse2 (+ .cse0 1)))) (= v_~b2~0_104 1)))) InVars {~A~0.base=v_~A~0.base_201, ~A~0.offset=v_~A~0.offset_201, #memory_int=|v_#memory_int_386|, ~N~0=v_~N~0_158} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_39|, ~A~0.base=v_~A~0.base_201, ~b2~0=v_~b2~0_104, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_39|, ~N~0=v_~N~0_158, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_65|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_39|, ~A~0.offset=v_~A~0.offset_201, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_90, #memory_int=|v_#memory_int_385|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_43|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_39|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, ~b2~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_~i~1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:31,603 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:08:31,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 445 [2022-12-13 02:08:31,604 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 82 transitions, 469 flow [2022-12-13 02:08:31,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:31,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:31,604 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:31,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:08:31,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1989492922, now seen corresponding path program 1 times [2022-12-13 02:08:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:31,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569652543] [2022-12-13 02:08:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:31,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569652543] [2022-12-13 02:08:31,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569652543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:31,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:31,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:08:31,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103130314] [2022-12-13 02:08:31,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:31,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:08:31,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:31,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:08:31,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:08:31,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 02:08:31,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 82 transitions, 469 flow. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:31,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:31,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 02:08:31,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:32,901 INFO L130 PetriNetUnfolder]: 7845/10847 cut-off events. [2022-12-13 02:08:32,901 INFO L131 PetriNetUnfolder]: For 71620/71620 co-relation queries the response was YES. [2022-12-13 02:08:32,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44010 conditions, 10847 events. 7845/10847 cut-off events. For 71620/71620 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 53647 event pairs, 1269 based on Foata normal form. 6/10603 useless extension candidates. Maximal degree in co-relation 43976. Up to 4069 conditions per place. [2022-12-13 02:08:32,949 INFO L137 encePairwiseOnDemand]: 20/41 looper letters, 85 selfloop transitions, 8 changer transitions 238/331 dead transitions. [2022-12-13 02:08:32,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 331 transitions, 2480 flow [2022-12-13 02:08:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:08:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:08:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-12-13 02:08:32,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4035476718403548 [2022-12-13 02:08:32,952 INFO L175 Difference]: Start difference. First operand has 68 places, 82 transitions, 469 flow. Second operand 11 states and 182 transitions. [2022-12-13 02:08:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 331 transitions, 2480 flow [2022-12-13 02:08:33,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 331 transitions, 2313 flow, removed 50 selfloop flow, removed 10 redundant places. [2022-12-13 02:08:33,120 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 603 flow [2022-12-13 02:08:33,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=603, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2022-12-13 02:08:33,121 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2022-12-13 02:08:33,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:33,121 INFO L89 Accepts]: Start accepts. Operand has 77 places, 82 transitions, 603 flow [2022-12-13 02:08:33,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:33,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:33,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 82 transitions, 603 flow [2022-12-13 02:08:33,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 82 transitions, 603 flow [2022-12-13 02:08:33,173 INFO L130 PetriNetUnfolder]: 328/617 cut-off events. [2022-12-13 02:08:33,173 INFO L131 PetriNetUnfolder]: For 3486/3532 co-relation queries the response was YES. [2022-12-13 02:08:33,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 617 events. 328/617 cut-off events. For 3486/3532 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2869 event pairs, 73 based on Foata normal form. 3/582 useless extension candidates. Maximal degree in co-relation 2791. Up to 220 conditions per place. [2022-12-13 02:08:33,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 82 transitions, 603 flow [2022-12-13 02:08:33,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 684 [2022-12-13 02:08:33,179 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:33,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 02:08:33,180 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 82 transitions, 603 flow [2022-12-13 02:08:33,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:33,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:33,180 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:33,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 02:08:33,181 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1184143302, now seen corresponding path program 2 times [2022-12-13 02:08:33,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:33,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625113527] [2022-12-13 02:08:33,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:33,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:33,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625113527] [2022-12-13 02:08:33,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625113527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:33,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:08:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246392291] [2022-12-13 02:08:33,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:33,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:08:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:08:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:08:33,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:08:33,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 82 transitions, 603 flow. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:33,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:33,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:08:33,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:34,981 INFO L130 PetriNetUnfolder]: 8080/11177 cut-off events. [2022-12-13 02:08:34,981 INFO L131 PetriNetUnfolder]: For 100778/100778 co-relation queries the response was YES. [2022-12-13 02:08:35,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57381 conditions, 11177 events. 8080/11177 cut-off events. For 100778/100778 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 55576 event pairs, 1734 based on Foata normal form. 12/10919 useless extension candidates. Maximal degree in co-relation 57341. Up to 3956 conditions per place. [2022-12-13 02:08:35,036 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 99 selfloop transitions, 19 changer transitions 272/390 dead transitions. [2022-12-13 02:08:35,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 390 transitions, 3796 flow [2022-12-13 02:08:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:08:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:08:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-12-13 02:08:35,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40433925049309666 [2022-12-13 02:08:35,038 INFO L175 Difference]: Start difference. First operand has 68 places, 82 transitions, 603 flow. Second operand 13 states and 205 transitions. [2022-12-13 02:08:35,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 390 transitions, 3796 flow [2022-12-13 02:08:35,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 390 transitions, 3396 flow, removed 193 selfloop flow, removed 7 redundant places. [2022-12-13 02:08:35,287 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 818 flow [2022-12-13 02:08:35,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=818, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2022-12-13 02:08:35,288 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2022-12-13 02:08:35,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:35,288 INFO L89 Accepts]: Start accepts. Operand has 83 places, 92 transitions, 818 flow [2022-12-13 02:08:35,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:35,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:35,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 92 transitions, 818 flow [2022-12-13 02:08:35,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 92 transitions, 818 flow [2022-12-13 02:08:35,337 INFO L130 PetriNetUnfolder]: 352/682 cut-off events. [2022-12-13 02:08:35,337 INFO L131 PetriNetUnfolder]: For 6171/6218 co-relation queries the response was YES. [2022-12-13 02:08:35,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3492 conditions, 682 events. 352/682 cut-off events. For 6171/6218 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3361 event pairs, 37 based on Foata normal form. 5/651 useless extension candidates. Maximal degree in co-relation 3448. Up to 229 conditions per place. [2022-12-13 02:08:35,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 92 transitions, 818 flow [2022-12-13 02:08:35,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-13 02:08:35,352 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:35,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 02:08:35,353 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 92 transitions, 818 flow [2022-12-13 02:08:35,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:35,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:35,354 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:35,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 02:08:35,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1817069206, now seen corresponding path program 3 times [2022-12-13 02:08:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:35,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174947427] [2022-12-13 02:08:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:36,047 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 02:08:36,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:36,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174947427] [2022-12-13 02:08:36,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174947427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:36,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850806284] [2022-12-13 02:08:36,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 02:08:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:36,049 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 02:08:36,051 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 02:08:36,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 02:08:36,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:08:36,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:08:36,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:36,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 02:08:36,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:08:36,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 02:08:36,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 02:08:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:36,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:08:36,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850806284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:36,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:08:36,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2022-12-13 02:08:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517849771] [2022-12-13 02:08:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:36,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:08:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:08:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-12-13 02:08:36,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:08:36,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 92 transitions, 818 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:36,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:36,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:08:36,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:38,178 INFO L130 PetriNetUnfolder]: 11256/15608 cut-off events. [2022-12-13 02:08:38,179 INFO L131 PetriNetUnfolder]: For 185140/185140 co-relation queries the response was YES. [2022-12-13 02:08:38,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87454 conditions, 15608 events. 11256/15608 cut-off events. For 185140/185140 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 81425 event pairs, 3186 based on Foata normal form. 10/15306 useless extension candidates. Maximal degree in co-relation 87385. Up to 5017 conditions per place. [2022-12-13 02:08:38,253 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 193 selfloop transitions, 18 changer transitions 272/483 dead transitions. [2022-12-13 02:08:38,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 483 transitions, 5350 flow [2022-12-13 02:08:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:08:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:08:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 260 transitions. [2022-12-13 02:08:38,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 02:08:38,256 INFO L175 Difference]: Start difference. First operand has 77 places, 92 transitions, 818 flow. Second operand 16 states and 260 transitions. [2022-12-13 02:08:38,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 483 transitions, 5350 flow [2022-12-13 02:08:39,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 483 transitions, 4694 flow, removed 324 selfloop flow, removed 7 redundant places. [2022-12-13 02:08:39,106 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 1073 flow [2022-12-13 02:08:39,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1073, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2022-12-13 02:08:39,107 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2022-12-13 02:08:39,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:39,107 INFO L89 Accepts]: Start accepts. Operand has 97 places, 105 transitions, 1073 flow [2022-12-13 02:08:39,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:39,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:39,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 105 transitions, 1073 flow [2022-12-13 02:08:39,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 105 transitions, 1073 flow [2022-12-13 02:08:39,334 INFO L130 PetriNetUnfolder]: 697/1379 cut-off events. [2022-12-13 02:08:39,334 INFO L131 PetriNetUnfolder]: For 12943/13021 co-relation queries the response was YES. [2022-12-13 02:08:39,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 1379 events. 697/1379 cut-off events. For 12943/13021 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 8326 event pairs, 112 based on Foata normal form. 13/1330 useless extension candidates. Maximal degree in co-relation 7517. Up to 448 conditions per place. [2022-12-13 02:08:39,352 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 105 transitions, 1073 flow [2022-12-13 02:08:39,353 INFO L226 LiptonReduction]: Number of co-enabled transitions 806 [2022-12-13 02:08:39,354 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:39,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-13 02:08:39,355 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 105 transitions, 1073 flow [2022-12-13 02:08:39,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:39,355 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:39,355 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:39,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 02:08:39,557 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,SelfDestructingSolverStorable9 [2022-12-13 02:08:39,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1843192514, now seen corresponding path program 4 times [2022-12-13 02:08:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:39,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60847460] [2022-12-13 02:08:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:39,959 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 02:08:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:39,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60847460] [2022-12-13 02:08:39,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60847460] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:39,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349034667] [2022-12-13 02:08:39,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 02:08:39,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:39,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:39,962 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 02:08:39,964 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 02:08:40,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 02:08:40,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:08:40,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 02:08:40,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:40,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 02:08:40,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:08:40,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:08:40,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:08:40,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:08:40,228 INFO L321 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2022-12-13 02:08:40,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2022-12-13 02:08:40,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:08:40,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2022-12-13 02:08:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:40,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:08:40,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349034667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:40,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:08:40,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 17 [2022-12-13 02:08:40,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158857502] [2022-12-13 02:08:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:40,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:08:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:08:40,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-12-13 02:08:40,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:08:40,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 105 transitions, 1073 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:40,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:40,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:08:40,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:42,755 INFO L130 PetriNetUnfolder]: 8824/12333 cut-off events. [2022-12-13 02:08:42,755 INFO L131 PetriNetUnfolder]: For 172139/172139 co-relation queries the response was YES. [2022-12-13 02:08:42,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73750 conditions, 12333 events. 8824/12333 cut-off events. For 172139/172139 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 62888 event pairs, 2746 based on Foata normal form. 7/12100 useless extension candidates. Maximal degree in co-relation 73675. Up to 4191 conditions per place. [2022-12-13 02:08:42,843 INFO L137 encePairwiseOnDemand]: 20/39 looper letters, 212 selfloop transitions, 44 changer transitions 205/461 dead transitions. [2022-12-13 02:08:42,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 461 transitions, 5751 flow [2022-12-13 02:08:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:08:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:08:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 228 transitions. [2022-12-13 02:08:42,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3438914027149321 [2022-12-13 02:08:42,845 INFO L175 Difference]: Start difference. First operand has 88 places, 105 transitions, 1073 flow. Second operand 17 states and 228 transitions. [2022-12-13 02:08:42,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 461 transitions, 5751 flow [2022-12-13 02:08:43,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 461 transitions, 5024 flow, removed 361 selfloop flow, removed 8 redundant places. [2022-12-13 02:08:43,197 INFO L231 Difference]: Finished difference. Result has 109 places, 139 transitions, 1640 flow [2022-12-13 02:08:43,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1640, PETRI_PLACES=109, PETRI_TRANSITIONS=139} [2022-12-13 02:08:43,197 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 69 predicate places. [2022-12-13 02:08:43,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:43,198 INFO L89 Accepts]: Start accepts. Operand has 109 places, 139 transitions, 1640 flow [2022-12-13 02:08:43,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:43,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:43,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 139 transitions, 1640 flow [2022-12-13 02:08:43,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 139 transitions, 1640 flow [2022-12-13 02:08:43,320 INFO L130 PetriNetUnfolder]: 915/1714 cut-off events. [2022-12-13 02:08:43,321 INFO L131 PetriNetUnfolder]: For 19922/20088 co-relation queries the response was YES. [2022-12-13 02:08:43,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10388 conditions, 1714 events. 915/1714 cut-off events. For 19922/20088 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 10246 event pairs, 127 based on Foata normal form. 15/1653 useless extension candidates. Maximal degree in co-relation 10324. Up to 646 conditions per place. [2022-12-13 02:08:43,342 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 139 transitions, 1640 flow [2022-12-13 02:08:43,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 1016 [2022-12-13 02:08:43,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:43,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:43,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_147 0) (= (select (select |v_#memory_int_407| v_~A~0.base_215) v_~A~0.offset_215) v_~min~0_216) (= v_~b1~0_99 1)) InVars {~A~0.base=v_~A~0.base_215, ~A~0.offset=v_~A~0.offset_215, #memory_int=|v_#memory_int_407|} OutVars{~A~0.base=v_~A~0.base_215, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_26|, ~A~0.offset=v_~A~0.offset_215, ~min~0=v_~min~0_216, #memory_int=|v_#memory_int_407|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_147, ~b1~0=v_~b1~0_99} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, ~min~0, thread1Thread1of1ForFork1_~i~0, ~b1~0] and [655] L68-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_484| v_~A~0.base_253)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_120| 4) v_~A~0.offset_253))) (let ((.cse0 (select .cse1 .cse2))) (and (= v_thread2Thread1of1ForFork3_~i~1_104 0) (= (+ |v_thread3Thread1of1ForFork0_~i~2#1_120| 1) |v_thread3Thread1of1ForFork0_~i~2#1_119|) (= (ite (< .cse0 2147483647) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_73|) (= v_~b2~0_118 1) (= |v_#memory_int_483| (store |v_#memory_int_484| v_~A~0.base_253 (store .cse1 .cse2 (+ .cse0 1)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_73| 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_120| v_~N~0_194)))) InVars {~A~0.base=v_~A~0.base_253, ~A~0.offset=v_~A~0.offset_253, #memory_int=|v_#memory_int_484|, ~N~0=v_~N~0_194, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_120|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_73|, ~A~0.base=v_~A~0.base_253, ~b2~0=v_~b2~0_118, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_73|, ~N~0=v_~N~0_194, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_119|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_73|, ~A~0.offset=v_~A~0.offset_253, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_104, #memory_int=|v_#memory_int_483|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_77|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_73|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, ~b2~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_~i~1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 02:08:43,662 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:08:43,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 465 [2022-12-13 02:08:43,663 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 139 transitions, 1668 flow [2022-12-13 02:08:43,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:43,663 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:43,663 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:43,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 02:08:43,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:43,869 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1727168142, now seen corresponding path program 5 times [2022-12-13 02:08:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:43,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851527496] [2022-12-13 02:08:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:44,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851527496] [2022-12-13 02:08:44,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851527496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:44,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:44,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:08:44,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952585026] [2022-12-13 02:08:44,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:44,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:08:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:44,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:08:44,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:08:44,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 02:08:44,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 139 transitions, 1668 flow. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:44,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:44,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 02:08:44,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:46,307 INFO L130 PetriNetUnfolder]: 9838/13678 cut-off events. [2022-12-13 02:08:46,307 INFO L131 PetriNetUnfolder]: For 195390/195390 co-relation queries the response was YES. [2022-12-13 02:08:46,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83999 conditions, 13678 events. 9838/13678 cut-off events. For 195390/195390 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 70088 event pairs, 2937 based on Foata normal form. 6/13403 useless extension candidates. Maximal degree in co-relation 83926. Up to 4585 conditions per place. [2022-12-13 02:08:46,377 INFO L137 encePairwiseOnDemand]: 26/41 looper letters, 203 selfloop transitions, 30 changer transitions 212/445 dead transitions. [2022-12-13 02:08:46,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 445 transitions, 5449 flow [2022-12-13 02:08:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:08:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:08:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 226 transitions. [2022-12-13 02:08:46,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2022-12-13 02:08:46,380 INFO L175 Difference]: Start difference. First operand has 98 places, 139 transitions, 1668 flow. Second operand 12 states and 226 transitions. [2022-12-13 02:08:46,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 445 transitions, 5449 flow [2022-12-13 02:08:46,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 445 transitions, 4881 flow, removed 284 selfloop flow, removed 11 redundant places. [2022-12-13 02:08:46,878 INFO L231 Difference]: Finished difference. Result has 106 places, 136 transitions, 1628 flow [2022-12-13 02:08:46,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1628, PETRI_PLACES=106, PETRI_TRANSITIONS=136} [2022-12-13 02:08:46,878 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 66 predicate places. [2022-12-13 02:08:46,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:46,879 INFO L89 Accepts]: Start accepts. Operand has 106 places, 136 transitions, 1628 flow [2022-12-13 02:08:46,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:46,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:46,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 136 transitions, 1628 flow [2022-12-13 02:08:46,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 136 transitions, 1628 flow [2022-12-13 02:08:46,993 INFO L130 PetriNetUnfolder]: 837/1601 cut-off events. [2022-12-13 02:08:46,993 INFO L131 PetriNetUnfolder]: For 17827/17943 co-relation queries the response was YES. [2022-12-13 02:08:47,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9331 conditions, 1601 events. 837/1601 cut-off events. For 17827/17943 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 9636 event pairs, 114 based on Foata normal form. 14/1545 useless extension candidates. Maximal degree in co-relation 9261. Up to 587 conditions per place. [2022-12-13 02:08:47,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 136 transitions, 1628 flow [2022-12-13 02:08:47,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 988 [2022-12-13 02:08:47,012 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:47,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:08:47,012 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 136 transitions, 1628 flow [2022-12-13 02:08:47,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:47,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:47,013 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:47,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 02:08:47,013 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1657280018, now seen corresponding path program 6 times [2022-12-13 02:08:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:47,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121059435] [2022-12-13 02:08:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:47,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121059435] [2022-12-13 02:08:47,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121059435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:47,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:47,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 02:08:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174058126] [2022-12-13 02:08:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:47,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:08:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:08:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:08:47,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:08:47,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 136 transitions, 1628 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:47,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:47,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:08:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:50,301 INFO L130 PetriNetUnfolder]: 14769/20522 cut-off events. [2022-12-13 02:08:50,302 INFO L131 PetriNetUnfolder]: For 251480/251480 co-relation queries the response was YES. [2022-12-13 02:08:50,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118854 conditions, 20522 events. 14769/20522 cut-off events. For 251480/251480 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 112197 event pairs, 3007 based on Foata normal form. 20/20189 useless extension candidates. Maximal degree in co-relation 118775. Up to 6442 conditions per place. [2022-12-13 02:08:50,690 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 200 selfloop transitions, 46 changer transitions 498/744 dead transitions. [2022-12-13 02:08:50,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 744 transitions, 8702 flow [2022-12-13 02:08:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 02:08:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 02:08:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 383 transitions. [2022-12-13 02:08:50,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41630434782608694 [2022-12-13 02:08:50,693 INFO L175 Difference]: Start difference. First operand has 101 places, 136 transitions, 1628 flow. Second operand 23 states and 383 transitions. [2022-12-13 02:08:50,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 744 transitions, 8702 flow [2022-12-13 02:08:51,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 744 transitions, 8425 flow, removed 117 selfloop flow, removed 9 redundant places. [2022-12-13 02:08:51,426 INFO L231 Difference]: Finished difference. Result has 133 places, 134 transitions, 1875 flow [2022-12-13 02:08:51,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1875, PETRI_PLACES=133, PETRI_TRANSITIONS=134} [2022-12-13 02:08:51,427 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2022-12-13 02:08:51,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:51,427 INFO L89 Accepts]: Start accepts. Operand has 133 places, 134 transitions, 1875 flow [2022-12-13 02:08:51,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:51,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:51,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 134 transitions, 1875 flow [2022-12-13 02:08:51,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 134 transitions, 1875 flow [2022-12-13 02:08:51,582 INFO L130 PetriNetUnfolder]: 749/1461 cut-off events. [2022-12-13 02:08:51,582 INFO L131 PetriNetUnfolder]: For 30834/30942 co-relation queries the response was YES. [2022-12-13 02:08:51,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10619 conditions, 1461 events. 749/1461 cut-off events. For 30834/30942 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8511 event pairs, 132 based on Foata normal form. 13/1414 useless extension candidates. Maximal degree in co-relation 10511. Up to 532 conditions per place. [2022-12-13 02:08:51,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 134 transitions, 1875 flow [2022-12-13 02:08:51,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 1008 [2022-12-13 02:08:51,616 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:51,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 02:08:51,617 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 134 transitions, 1875 flow [2022-12-13 02:08:51,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:51,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:51,617 INFO L214 CegarLoopForPetriNet]: trace 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] [2022-12-13 02:08:51,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 02:08:51,617 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 970508920, now seen corresponding path program 1 times [2022-12-13 02:08:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:51,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540759724] [2022-12-13 02:08:51,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 02:08:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:51,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540759724] [2022-12-13 02:08:51,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540759724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:51,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:51,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:08:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737984291] [2022-12-13 02:08:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:51,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:51,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:08:51,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 134 transitions, 1875 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:51,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:51,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:08:51,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:53,227 INFO L130 PetriNetUnfolder]: 6609/9283 cut-off events. [2022-12-13 02:08:53,228 INFO L131 PetriNetUnfolder]: For 220129/220129 co-relation queries the response was YES. [2022-12-13 02:08:53,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66397 conditions, 9283 events. 6609/9283 cut-off events. For 220129/220129 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 45401 event pairs, 2929 based on Foata normal form. 396/9526 useless extension candidates. Maximal degree in co-relation 66280. Up to 4256 conditions per place. [2022-12-13 02:08:53,322 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 211 selfloop transitions, 33 changer transitions 0/244 dead transitions. [2022-12-13 02:08:53,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 244 transitions, 3800 flow [2022-12-13 02:08:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:08:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:08:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 02:08:53,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2022-12-13 02:08:53,323 INFO L175 Difference]: Start difference. First operand has 120 places, 134 transitions, 1875 flow. Second operand 4 states and 95 transitions. [2022-12-13 02:08:53,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 244 transitions, 3800 flow [2022-12-13 02:08:53,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 244 transitions, 3139 flow, removed 307 selfloop flow, removed 19 redundant places. [2022-12-13 02:08:53,953 INFO L231 Difference]: Finished difference. Result has 106 places, 148 transitions, 1911 flow [2022-12-13 02:08:53,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1911, PETRI_PLACES=106, PETRI_TRANSITIONS=148} [2022-12-13 02:08:53,953 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 66 predicate places. [2022-12-13 02:08:53,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:53,954 INFO L89 Accepts]: Start accepts. Operand has 106 places, 148 transitions, 1911 flow [2022-12-13 02:08:53,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:53,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:53,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 148 transitions, 1911 flow [2022-12-13 02:08:53,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 148 transitions, 1911 flow [2022-12-13 02:08:54,086 INFO L130 PetriNetUnfolder]: 965/1821 cut-off events. [2022-12-13 02:08:54,087 INFO L131 PetriNetUnfolder]: For 21983/22228 co-relation queries the response was YES. [2022-12-13 02:08:54,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11270 conditions, 1821 events. 965/1821 cut-off events. For 21983/22228 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10877 event pairs, 162 based on Foata normal form. 11/1765 useless extension candidates. Maximal degree in co-relation 8401. Up to 688 conditions per place. [2022-12-13 02:08:54,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 148 transitions, 1911 flow [2022-12-13 02:08:54,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 1126 [2022-12-13 02:08:54,109 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:54,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 02:08:54,110 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 148 transitions, 1911 flow [2022-12-13 02:08:54,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:54,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:54,110 INFO L214 CegarLoopForPetriNet]: trace 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 02:08:54,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:08:54,111 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1737432495, now seen corresponding path program 1 times [2022-12-13 02:08:54,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:54,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241101489] [2022-12-13 02:08:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:54,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241101489] [2022-12-13 02:08:54,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241101489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:54,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287878281] [2022-12-13 02:08:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:54,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:54,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:54,256 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 02:08:54,263 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 02:08:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:54,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:08:54,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:54,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:08:54,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287878281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:54,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:08:54,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-13 02:08:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450947329] [2022-12-13 02:08:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:54,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:08:54,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:08:54,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 148 transitions, 1911 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:54,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:54,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:08:54,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:55,429 INFO L130 PetriNetUnfolder]: 6198/8677 cut-off events. [2022-12-13 02:08:55,429 INFO L131 PetriNetUnfolder]: For 112028/112028 co-relation queries the response was YES. [2022-12-13 02:08:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53363 conditions, 8677 events. 6198/8677 cut-off events. For 112028/112028 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 41895 event pairs, 2238 based on Foata normal form. 287/8812 useless extension candidates. Maximal degree in co-relation 37381. Up to 3674 conditions per place. [2022-12-13 02:08:55,482 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 227 selfloop transitions, 18 changer transitions 0/245 dead transitions. [2022-12-13 02:08:55,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 245 transitions, 3402 flow [2022-12-13 02:08:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 02:08:55,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49743589743589745 [2022-12-13 02:08:55,483 INFO L175 Difference]: Start difference. First operand has 106 places, 148 transitions, 1911 flow. Second operand 5 states and 97 transitions. [2022-12-13 02:08:55,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 245 transitions, 3402 flow [2022-12-13 02:08:55,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 245 transitions, 3359 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-13 02:08:55,681 INFO L231 Difference]: Finished difference. Result has 112 places, 165 transitions, 2161 flow [2022-12-13 02:08:55,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2161, PETRI_PLACES=112, PETRI_TRANSITIONS=165} [2022-12-13 02:08:55,682 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 72 predicate places. [2022-12-13 02:08:55,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:55,682 INFO L89 Accepts]: Start accepts. Operand has 112 places, 165 transitions, 2161 flow [2022-12-13 02:08:55,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:55,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:55,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 165 transitions, 2161 flow [2022-12-13 02:08:55,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 165 transitions, 2161 flow [2022-12-13 02:08:55,853 INFO L130 PetriNetUnfolder]: 962/1762 cut-off events. [2022-12-13 02:08:55,853 INFO L131 PetriNetUnfolder]: For 22427/22655 co-relation queries the response was YES. [2022-12-13 02:08:55,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11526 conditions, 1762 events. 962/1762 cut-off events. For 22427/22655 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10075 event pairs, 151 based on Foata normal form. 7/1735 useless extension candidates. Maximal degree in co-relation 8680. Up to 682 conditions per place. [2022-12-13 02:08:55,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 165 transitions, 2161 flow [2022-12-13 02:08:55,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 1234 [2022-12-13 02:08:55,875 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:55,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-13 02:08:55,875 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 165 transitions, 2161 flow [2022-12-13 02:08:55,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:55,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:55,876 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 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 02:08:55,881 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 02:08:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 02:08:56,076 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash 188617573, now seen corresponding path program 1 times [2022-12-13 02:08:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:56,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548906001] [2022-12-13 02:08:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 02:08:56,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:56,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548906001] [2022-12-13 02:08:56,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548906001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:56,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:56,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452451874] [2022-12-13 02:08:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:56,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:56,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:56,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:08:56,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 165 transitions, 2161 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:56,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:56,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:08:56,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:56,952 INFO L130 PetriNetUnfolder]: 3934/5541 cut-off events. [2022-12-13 02:08:56,952 INFO L131 PetriNetUnfolder]: For 84929/84929 co-relation queries the response was YES. [2022-12-13 02:08:56,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36059 conditions, 5541 events. 3934/5541 cut-off events. For 84929/84929 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25116 event pairs, 971 based on Foata normal form. 84/5609 useless extension candidates. Maximal degree in co-relation 33302. Up to 3669 conditions per place. [2022-12-13 02:08:56,984 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 161 selfloop transitions, 1 changer transitions 39/201 dead transitions. [2022-12-13 02:08:56,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 201 transitions, 2759 flow [2022-12-13 02:08:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-13 02:08:56,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2022-12-13 02:08:56,986 INFO L175 Difference]: Start difference. First operand has 112 places, 165 transitions, 2161 flow. Second operand 5 states and 80 transitions. [2022-12-13 02:08:56,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 201 transitions, 2759 flow [2022-12-13 02:08:57,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 201 transitions, 2615 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-12-13 02:08:57,064 INFO L231 Difference]: Finished difference. Result has 109 places, 116 transitions, 1343 flow [2022-12-13 02:08:57,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1343, PETRI_PLACES=109, PETRI_TRANSITIONS=116} [2022-12-13 02:08:57,065 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 69 predicate places. [2022-12-13 02:08:57,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:57,065 INFO L89 Accepts]: Start accepts. Operand has 109 places, 116 transitions, 1343 flow [2022-12-13 02:08:57,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:57,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:57,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 116 transitions, 1343 flow [2022-12-13 02:08:57,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 116 transitions, 1343 flow [2022-12-13 02:08:57,148 INFO L130 PetriNetUnfolder]: 653/1129 cut-off events. [2022-12-13 02:08:57,148 INFO L131 PetriNetUnfolder]: For 14843/14966 co-relation queries the response was YES. [2022-12-13 02:08:57,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7405 conditions, 1129 events. 653/1129 cut-off events. For 14843/14966 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5615 event pairs, 80 based on Foata normal form. 0/1111 useless extension candidates. Maximal degree in co-relation 7231. Up to 467 conditions per place. [2022-12-13 02:08:57,160 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 116 transitions, 1343 flow [2022-12-13 02:08:57,160 INFO L226 LiptonReduction]: Number of co-enabled transitions 844 [2022-12-13 02:08:57,168 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:57,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:08:57,169 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 116 transitions, 1343 flow [2022-12-13 02:08:57,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:57,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:57,169 INFO L214 CegarLoopForPetriNet]: trace 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 02:08:57,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 02:08:57,169 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1466157599, now seen corresponding path program 1 times [2022-12-13 02:08:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054509533] [2022-12-13 02:08:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:57,251 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 02:08:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054509533] [2022-12-13 02:08:57,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054509533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515417006] [2022-12-13 02:08:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:57,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:57,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:57,256 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 02:08:57,295 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 02:08:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:57,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:08:57,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:57,435 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 02:08:57,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:08:57,462 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 02:08:57,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515417006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:08:57,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:08:57,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 02:08:57,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010294475] [2022-12-13 02:08:57,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:08:57,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:08:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:57,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:08:57,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:08:57,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:08:57,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 116 transitions, 1343 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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 02:08:57,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:57,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:08:57,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:58,326 INFO L130 PetriNetUnfolder]: 4648/6401 cut-off events. [2022-12-13 02:08:58,326 INFO L131 PetriNetUnfolder]: For 86231/86231 co-relation queries the response was YES. [2022-12-13 02:08:58,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41011 conditions, 6401 events. 4648/6401 cut-off events. For 86231/86231 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 29384 event pairs, 730 based on Foata normal form. 379/6760 useless extension candidates. Maximal degree in co-relation 35541. Up to 3735 conditions per place. [2022-12-13 02:08:58,375 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 200 selfloop transitions, 18 changer transitions 0/218 dead transitions. [2022-12-13 02:08:58,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 218 transitions, 3085 flow [2022-12-13 02:08:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-13 02:08:58,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4052631578947368 [2022-12-13 02:08:58,376 INFO L175 Difference]: Start difference. First operand has 98 places, 116 transitions, 1343 flow. Second operand 5 states and 77 transitions. [2022-12-13 02:08:58,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 218 transitions, 3085 flow [2022-12-13 02:08:58,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 218 transitions, 2742 flow, removed 88 selfloop flow, removed 13 redundant places. [2022-12-13 02:08:58,481 INFO L231 Difference]: Finished difference. Result has 90 places, 117 transitions, 1233 flow [2022-12-13 02:08:58,481 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1233, PETRI_PLACES=90, PETRI_TRANSITIONS=117} [2022-12-13 02:08:58,482 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2022-12-13 02:08:58,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:58,482 INFO L89 Accepts]: Start accepts. Operand has 90 places, 117 transitions, 1233 flow [2022-12-13 02:08:58,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:58,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:58,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 117 transitions, 1233 flow [2022-12-13 02:08:58,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 117 transitions, 1233 flow [2022-12-13 02:08:58,606 INFO L130 PetriNetUnfolder]: 784/1390 cut-off events. [2022-12-13 02:08:58,607 INFO L131 PetriNetUnfolder]: For 16904/17074 co-relation queries the response was YES. [2022-12-13 02:08:58,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9054 conditions, 1390 events. 784/1390 cut-off events. For 16904/17074 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7548 event pairs, 132 based on Foata normal form. 5/1371 useless extension candidates. Maximal degree in co-relation 6404. Up to 649 conditions per place. [2022-12-13 02:08:58,620 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 117 transitions, 1233 flow [2022-12-13 02:08:58,620 INFO L226 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-13 02:08:58,636 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:58,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 02:08:58,637 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 117 transitions, 1233 flow [2022-12-13 02:08:58,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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 02:08:58,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:58,637 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 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 02:08:58,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 02:08:58,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 02:08:58,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:08:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1751896438, now seen corresponding path program 2 times [2022-12-13 02:08:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:58,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366401130] [2022-12-13 02:08:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 02:08:59,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:59,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366401130] [2022-12-13 02:08:59,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366401130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:59,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147748051] [2022-12-13 02:08:59,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:08:59,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:59,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:59,416 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 02:08:59,442 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 02:08:59,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:08:59,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:08:59,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 02:08:59,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:59,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:08:59,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:08:59,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:08:59,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 20 [2022-12-13 02:08:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 02:08:59,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:00,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:00,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 97 [2022-12-13 02:09:00,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:00,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 82 [2022-12-13 02:09:00,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:00,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 74 [2022-12-13 02:09:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 02:09:00,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147748051] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:00,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:00,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-13 02:09:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143916462] [2022-12-13 02:09:00,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:00,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 02:09:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:00,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 02:09:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=385, Unknown=2, NotChecked=0, Total=462 [2022-12-13 02:09:00,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:09:00,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 117 transitions, 1233 flow. Second operand has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 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 02:09:00,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:00,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:09:00,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:03,995 INFO L130 PetriNetUnfolder]: 15097/20798 cut-off events. [2022-12-13 02:09:03,995 INFO L131 PetriNetUnfolder]: For 229222/229222 co-relation queries the response was YES. [2022-12-13 02:09:04,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127871 conditions, 20798 events. 15097/20798 cut-off events. For 229222/229222 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 112059 event pairs, 2253 based on Foata normal form. 10/20772 useless extension candidates. Maximal degree in co-relation 75009. Up to 7052 conditions per place. [2022-12-13 02:09:04,112 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 255 selfloop transitions, 75 changer transitions 477/807 dead transitions. [2022-12-13 02:09:04,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 807 transitions, 9365 flow [2022-12-13 02:09:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 02:09:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 02:09:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 426 transitions. [2022-12-13 02:09:04,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3616298811544992 [2022-12-13 02:09:04,114 INFO L175 Difference]: Start difference. First operand has 90 places, 117 transitions, 1233 flow. Second operand 31 states and 426 transitions. [2022-12-13 02:09:04,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 807 transitions, 9365 flow [2022-12-13 02:09:04,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 807 transitions, 9056 flow, removed 56 selfloop flow, removed 3 redundant places. [2022-12-13 02:09:04,455 INFO L231 Difference]: Finished difference. Result has 140 places, 152 transitions, 2088 flow [2022-12-13 02:09:04,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2088, PETRI_PLACES=140, PETRI_TRANSITIONS=152} [2022-12-13 02:09:04,456 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 100 predicate places. [2022-12-13 02:09:04,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:04,456 INFO L89 Accepts]: Start accepts. Operand has 140 places, 152 transitions, 2088 flow [2022-12-13 02:09:04,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:04,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:04,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 152 transitions, 2088 flow [2022-12-13 02:09:04,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 152 transitions, 2088 flow [2022-12-13 02:09:04,784 INFO L130 PetriNetUnfolder]: 1077/1997 cut-off events. [2022-12-13 02:09:04,784 INFO L131 PetriNetUnfolder]: For 44477/44817 co-relation queries the response was YES. [2022-12-13 02:09:04,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15113 conditions, 1997 events. 1077/1997 cut-off events. For 44477/44817 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 12142 event pairs, 240 based on Foata normal form. 7/1973 useless extension candidates. Maximal degree in co-relation 15028. Up to 882 conditions per place. [2022-12-13 02:09:04,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 152 transitions, 2088 flow [2022-12-13 02:09:04,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-13 02:09:04,819 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:04,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 367 [2022-12-13 02:09:04,823 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 152 transitions, 2088 flow [2022-12-13 02:09:04,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 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 02:09:04,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:04,824 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 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 02:09:04,832 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 02:09:05,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 02:09:05,030 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:09:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1406149908, now seen corresponding path program 3 times [2022-12-13 02:09:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:05,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417086764] [2022-12-13 02:09:05,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 02:09:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:05,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417086764] [2022-12-13 02:09:05,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417086764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:05,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90618305] [2022-12-13 02:09:05,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 02:09:05,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:05,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:05,664 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 02:09:05,688 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 02:09:05,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 02:09:05,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:09:05,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 02:09:05,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:05,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:09:05,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2022-12-13 02:09:06,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:06,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 02:09:06,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:06,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 02:09:06,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:06,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 85 [2022-12-13 02:09:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:06,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:07,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90618305] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:07,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 02:09:07,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 11] total 25 [2022-12-13 02:09:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74545421] [2022-12-13 02:09:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:09:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:09:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-12-13 02:09:07,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:09:07,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 152 transitions, 2088 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 02:09:07,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:07,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:09:07,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:09,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:09:11,765 INFO L130 PetriNetUnfolder]: 12233/17018 cut-off events. [2022-12-13 02:09:11,765 INFO L131 PetriNetUnfolder]: For 418368/418368 co-relation queries the response was YES. [2022-12-13 02:09:11,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124703 conditions, 17018 events. 12233/17018 cut-off events. For 418368/418368 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 91446 event pairs, 3568 based on Foata normal form. 1/16998 useless extension candidates. Maximal degree in co-relation 124556. Up to 11477 conditions per place. [2022-12-13 02:09:11,944 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 216 selfloop transitions, 57 changer transitions 17/290 dead transitions. [2022-12-13 02:09:11,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 290 transitions, 4390 flow [2022-12-13 02:09:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:09:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:09:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-13 02:09:11,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2022-12-13 02:09:11,946 INFO L175 Difference]: Start difference. First operand has 124 places, 152 transitions, 2088 flow. Second operand 7 states and 132 transitions. [2022-12-13 02:09:11,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 290 transitions, 4390 flow [2022-12-13 02:09:13,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 290 transitions, 3934 flow, removed 185 selfloop flow, removed 17 redundant places. [2022-12-13 02:09:13,104 INFO L231 Difference]: Finished difference. Result has 118 places, 199 transitions, 2900 flow [2022-12-13 02:09:13,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2900, PETRI_PLACES=118, PETRI_TRANSITIONS=199} [2022-12-13 02:09:13,106 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2022-12-13 02:09:13,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:13,106 INFO L89 Accepts]: Start accepts. Operand has 118 places, 199 transitions, 2900 flow [2022-12-13 02:09:13,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:13,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:13,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 199 transitions, 2900 flow [2022-12-13 02:09:13,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 199 transitions, 2900 flow [2022-12-13 02:09:13,430 INFO L130 PetriNetUnfolder]: 1536/2958 cut-off events. [2022-12-13 02:09:13,430 INFO L131 PetriNetUnfolder]: For 55859/56377 co-relation queries the response was YES. [2022-12-13 02:09:13,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21604 conditions, 2958 events. 1536/2958 cut-off events. For 55859/56377 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 20118 event pairs, 274 based on Foata normal form. 5/2918 useless extension candidates. Maximal degree in co-relation 21531. Up to 1352 conditions per place. [2022-12-13 02:09:13,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 199 transitions, 2900 flow [2022-12-13 02:09:13,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 1620 [2022-12-13 02:09:13,492 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:13,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-13 02:09:13,493 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 199 transitions, 2900 flow [2022-12-13 02:09:13,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 02:09:13,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:13,493 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 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 02:09:13,499 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 02:09:13,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:13,696 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:09:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash 33047036, now seen corresponding path program 4 times [2022-12-13 02:09:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:13,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280838506] [2022-12-13 02:09:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:09:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:14,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280838506] [2022-12-13 02:09:14,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280838506] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:14,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467672304] [2022-12-13 02:09:14,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 02:09:14,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:14,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:14,405 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 02:09:14,408 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 02:09:14,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 02:09:14,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:09:14,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 02:09:14,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:14,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:09:14,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2022-12-13 02:09:14,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:14,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 02:09:14,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:14,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 02:09:14,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:14,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 22 [2022-12-13 02:09:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 02:09:14,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:15,103 WARN L837 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse1 (+ c_~max~0 1)) (.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset))) (and (forall ((v_ArrVal_968 Int) (v_ArrVal_970 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| c_~A~0.base (store .cse4 .cse5 v_ArrVal_968)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_970) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3))) (or (<= .cse0 .cse1) (< (select .cse2 c_~A~0.offset) .cse0))))) (forall ((v_ArrVal_968 Int) (v_ArrVal_970 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| c_~A~0.base (store .cse4 .cse5 v_ArrVal_968)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_970) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (or (not (< .cse6 (select .cse7 .cse3))) (<= .cse6 .cse1)))))))) is different from false [2022-12-13 02:09:23,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:23,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 130 [2022-12-13 02:09:23,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 107 [2022-12-13 02:09:23,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:23,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 99 [2022-12-13 02:09:23,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:23,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 89 [2022-12-13 02:09:23,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:23,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 96 [2022-12-13 02:09:23,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:23,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 86 [2022-12-13 02:09:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-12-13 02:09:23,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467672304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:23,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:23,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-12-13 02:09:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363586229] [2022-12-13 02:09:23,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 02:09:23,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 02:09:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=582, Unknown=5, NotChecked=50, Total=756 [2022-12-13 02:09:23,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:09:23,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 199 transitions, 2900 flow. Second operand has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 27 states have internal predecessors, (82), 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 02:09:23,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:23,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:09:23,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:28,408 INFO L130 PetriNetUnfolder]: 20917/29193 cut-off events. [2022-12-13 02:09:28,409 INFO L131 PetriNetUnfolder]: For 516935/516935 co-relation queries the response was YES. [2022-12-13 02:09:28,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200791 conditions, 29193 events. 20917/29193 cut-off events. For 516935/516935 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 167945 event pairs, 5642 based on Foata normal form. 20/29192 useless extension candidates. Maximal degree in co-relation 200704. Up to 14483 conditions per place. [2022-12-13 02:09:28,615 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 182 selfloop transitions, 30 changer transitions 360/572 dead transitions. [2022-12-13 02:09:28,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 572 transitions, 8764 flow [2022-12-13 02:09:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:09:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:09:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 205 transitions. [2022-12-13 02:09:28,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3173374613003096 [2022-12-13 02:09:28,617 INFO L175 Difference]: Start difference. First operand has 117 places, 199 transitions, 2900 flow. Second operand 17 states and 205 transitions. [2022-12-13 02:09:28,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 572 transitions, 8764 flow [2022-12-13 02:09:29,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 572 transitions, 8638 flow, removed 63 selfloop flow, removed 1 redundant places. [2022-12-13 02:09:29,421 INFO L231 Difference]: Finished difference. Result has 143 places, 185 transitions, 2924 flow [2022-12-13 02:09:29,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2846, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2924, PETRI_PLACES=143, PETRI_TRANSITIONS=185} [2022-12-13 02:09:29,421 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2022-12-13 02:09:29,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:29,422 INFO L89 Accepts]: Start accepts. Operand has 143 places, 185 transitions, 2924 flow [2022-12-13 02:09:29,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:29,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:29,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 185 transitions, 2924 flow [2022-12-13 02:09:29,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 185 transitions, 2924 flow [2022-12-13 02:09:29,767 INFO L130 PetriNetUnfolder]: 1369/2701 cut-off events. [2022-12-13 02:09:29,767 INFO L131 PetriNetUnfolder]: For 69480/70039 co-relation queries the response was YES. [2022-12-13 02:09:29,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21617 conditions, 2701 events. 1369/2701 cut-off events. For 69480/70039 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 18392 event pairs, 304 based on Foata normal form. 7/2633 useless extension candidates. Maximal degree in co-relation 21520. Up to 1239 conditions per place. [2022-12-13 02:09:29,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 185 transitions, 2924 flow [2022-12-13 02:09:29,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 1496 [2022-12-13 02:09:29,820 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:29,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 399 [2022-12-13 02:09:29,821 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 185 transitions, 2924 flow [2022-12-13 02:09:29,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 27 states have internal predecessors, (82), 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 02:09:29,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:29,822 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 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 02:09:29,834 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 02:09:30,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:30,032 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:09:30,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:30,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1239151390, now seen corresponding path program 5 times [2022-12-13 02:09:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:30,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883899845] [2022-12-13 02:09:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:30,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:30,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883899845] [2022-12-13 02:09:30,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883899845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267967549] [2022-12-13 02:09:30,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 02:09:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:30,992 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 02:09:30,994 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 02:09:31,139 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 02:09:31,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:09:31,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 02:09:31,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:31,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:31,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:09:31,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:09:31,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2022-12-13 02:09:31,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:31,902 INFO L321 Elim1Store]: treesize reduction 333, result has 33.3 percent of original size [2022-12-13 02:09:31,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 148 treesize of output 242 [2022-12-13 02:09:38,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:38,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 180 [2022-12-13 02:09:39,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:39,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 208 treesize of output 452 [2022-12-13 02:11:36,578 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:36,762 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:36,998 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:37,497 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:41,918 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:42,166 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:42,943 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:43,106 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:43,563 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:43,824 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:44,050 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:44,229 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:44,479 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:44,648 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:44,896 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:45,016 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:45,180 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:45,568 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:46,904 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:49,623 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:49,889 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:51,554 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:51,956 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:52,318 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:52,675 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:53,097 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:53,476 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:53,923 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:54,838 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:11:55,008 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:55,213 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:55,424 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:55,885 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:11:57,242 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:01,835 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:02,196 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:04,375 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:04,959 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:05,482 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:05,753 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:06,223 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:06,276 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:06,336 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:06,401 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:06,535 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:07,029 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:07,920 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:08,241 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:09,473 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:09,769 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:10,497 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:10,775 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:11,114 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:11,333 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:11,435 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:11,577 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:11,886 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:13,247 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:25,544 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:25,752 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:26,708 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:27,044 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:27,327 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:27,622 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:27,843 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:28,077 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:28,193 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 02:12:28,620 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 02:12:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:35,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:12:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267967549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:12:37,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:12:37,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 34 [2022-12-13 02:12:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999172620] [2022-12-13 02:12:37,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:12:37,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 02:12:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 02:12:37,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1019, Unknown=6, NotChecked=0, Total=1190 [2022-12-13 02:12:37,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:12:37,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 185 transitions, 2924 flow. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 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 02:12:37,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:37,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:12:37,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:46,743 WARN L233 SmtUtils]: Spent 9.07s on a formula simplification. DAG size of input: 197 DAG size of output: 188 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:12:49,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:12:52,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:13:08,764 WARN L233 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 202 DAG size of output: 191 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:13:14,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:13:20,526 INFO L130 PetriNetUnfolder]: 21098/29482 cut-off events. [2022-12-13 02:13:20,526 INFO L131 PetriNetUnfolder]: For 820253/820253 co-relation queries the response was YES. [2022-12-13 02:13:20,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231698 conditions, 29482 events. 21098/29482 cut-off events. For 820253/820253 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 171744 event pairs, 1882 based on Foata normal form. 11/29472 useless extension candidates. Maximal degree in co-relation 231527. Up to 11631 conditions per place. [2022-12-13 02:13:20,965 INFO L137 encePairwiseOnDemand]: 20/38 looper letters, 519 selfloop transitions, 158 changer transitions 152/829 dead transitions. [2022-12-13 02:13:20,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 829 transitions, 14197 flow [2022-12-13 02:13:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 02:13:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 02:13:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 420 transitions. [2022-12-13 02:13:20,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3349282296650718 [2022-12-13 02:13:20,968 INFO L175 Difference]: Start difference. First operand has 132 places, 185 transitions, 2924 flow. Second operand 33 states and 420 transitions. [2022-12-13 02:13:20,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 829 transitions, 14197 flow [2022-12-13 02:13:22,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 829 transitions, 13111 flow, removed 535 selfloop flow, removed 13 redundant places. [2022-12-13 02:13:22,816 INFO L231 Difference]: Finished difference. Result has 174 places, 312 transitions, 5546 flow [2022-12-13 02:13:22,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2710, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5546, PETRI_PLACES=174, PETRI_TRANSITIONS=312} [2022-12-13 02:13:22,817 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 134 predicate places. [2022-12-13 02:13:22,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:13:22,817 INFO L89 Accepts]: Start accepts. Operand has 174 places, 312 transitions, 5546 flow [2022-12-13 02:13:22,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:13:22,822 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:13:22,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 312 transitions, 5546 flow [2022-12-13 02:13:22,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 312 transitions, 5546 flow [2022-12-13 02:13:23,758 INFO L130 PetriNetUnfolder]: 2860/5442 cut-off events. [2022-12-13 02:13:23,758 INFO L131 PetriNetUnfolder]: For 166895/168224 co-relation queries the response was YES. [2022-12-13 02:13:23,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47874 conditions, 5442 events. 2860/5442 cut-off events. For 166895/168224 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 40706 event pairs, 542 based on Foata normal form. 24/5287 useless extension candidates. Maximal degree in co-relation 47691. Up to 2700 conditions per place. [2022-12-13 02:13:23,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 312 transitions, 5546 flow [2022-12-13 02:13:23,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 2576 [2022-12-13 02:13:23,899 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:13:23,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1083 [2022-12-13 02:13:23,900 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 312 transitions, 5546 flow [2022-12-13 02:13:23,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 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 02:13:23,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:13:23,901 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 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 02:13:23,905 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 02:13:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:24,101 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:13:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:13:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -951902084, now seen corresponding path program 6 times [2022-12-13 02:13:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:13:24,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568226025] [2022-12-13 02:13:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:13:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:13:24,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:13:24,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568226025] [2022-12-13 02:13:24,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568226025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:13:24,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175421376] [2022-12-13 02:13:24,936 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 02:13:24,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:24,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:13:24,937 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 02:13:24,939 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 02:13:25,243 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 02:13:25,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:13:25,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 02:13:25,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:13:25,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:13:25,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:13:25,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:13:25,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2022-12-13 02:13:25,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:13:25,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 02:13:25,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:13:25,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 02:13:25,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:13:25,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 22 [2022-12-13 02:13:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 02:13:25,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:13:25,881 WARN L837 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse1 (+ c_~max~0 1)) (.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset))) (and (forall ((v_ArrVal_1121 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| c_~A~0.base (store .cse4 .cse5 v_ArrVal_1121)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1122) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3))) (or (<= .cse0 .cse1) (< (select .cse2 c_~A~0.offset) .cse0))))) (forall ((v_ArrVal_1121 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| c_~A~0.base (store .cse4 .cse5 v_ArrVal_1121)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1122) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (or (not (< .cse6 (select .cse7 .cse3))) (<= .cse6 .cse1)))))))) is different from false [2022-12-13 02:13:40,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 277 [2022-12-13 02:13:40,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:13:40,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 252 [2022-12-13 02:13:40,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 250 [2022-12-13 02:13:40,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:13:40,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 234 [2022-12-13 02:13:40,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 232 [2022-12-13 02:13:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-12-13 02:13:40,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175421376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:13:40,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:13:40,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2022-12-13 02:13:40,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214524897] [2022-12-13 02:13:40,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:13:40,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 02:13:40,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:13:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 02:13:40,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=836, Unknown=17, NotChecked=60, Total=1056 [2022-12-13 02:13:40,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:13:40,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 312 transitions, 5546 flow. Second operand has 33 states, 32 states have (on average 2.5625) internal successors, (82), 32 states have internal predecessors, (82), 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 02:13:40,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:13:40,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:13:40,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:13:49,552 INFO L130 PetriNetUnfolder]: 30476/42408 cut-off events. [2022-12-13 02:13:49,552 INFO L131 PetriNetUnfolder]: For 1297163/1297163 co-relation queries the response was YES. [2022-12-13 02:13:50,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369653 conditions, 42408 events. 30476/42408 cut-off events. For 1297163/1297163 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 254698 event pairs, 5136 based on Foata normal form. 24/42411 useless extension candidates. Maximal degree in co-relation 369461. Up to 16397 conditions per place. [2022-12-13 02:13:50,107 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 188 selfloop transitions, 32 changer transitions 805/1025 dead transitions. [2022-12-13 02:13:50,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1025 transitions, 18753 flow [2022-12-13 02:13:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 02:13:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 02:13:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 244 transitions. [2022-12-13 02:13:50,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32105263157894737 [2022-12-13 02:13:50,109 INFO L175 Difference]: Start difference. First operand has 168 places, 312 transitions, 5546 flow. Second operand 20 states and 244 transitions. [2022-12-13 02:13:50,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1025 transitions, 18753 flow [2022-12-13 02:13:53,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1025 transitions, 17708 flow, removed 522 selfloop flow, removed 5 redundant places. [2022-12-13 02:13:53,280 INFO L231 Difference]: Finished difference. Result has 197 places, 194 transitions, 3508 flow [2022-12-13 02:13:53,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3508, PETRI_PLACES=197, PETRI_TRANSITIONS=194} [2022-12-13 02:13:53,281 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 157 predicate places. [2022-12-13 02:13:53,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:13:53,281 INFO L89 Accepts]: Start accepts. Operand has 197 places, 194 transitions, 3508 flow [2022-12-13 02:13:53,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:13:53,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:13:53,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 194 transitions, 3508 flow [2022-12-13 02:13:53,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 194 transitions, 3508 flow [2022-12-13 02:13:53,709 INFO L130 PetriNetUnfolder]: 1396/2903 cut-off events. [2022-12-13 02:13:53,709 INFO L131 PetriNetUnfolder]: For 103755/104461 co-relation queries the response was YES. [2022-12-13 02:13:53,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26192 conditions, 2903 events. 1396/2903 cut-off events. For 103755/104461 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20254 event pairs, 232 based on Foata normal form. 12/2852 useless extension candidates. Maximal degree in co-relation 26039. Up to 1266 conditions per place. [2022-12-13 02:13:53,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 194 transitions, 3508 flow [2022-12-13 02:13:53,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 1540 [2022-12-13 02:13:53,761 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:13:53,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 480 [2022-12-13 02:13:53,762 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 194 transitions, 3508 flow [2022-12-13 02:13:53,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5625) internal successors, (82), 32 states have internal predecessors, (82), 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 02:13:53,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:13:53,762 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 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 02:13:53,768 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 02:13:53,962 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,SelfDestructingSolverStorable21 [2022-12-13 02:13:53,963 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:13:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:13:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash -776241264, now seen corresponding path program 7 times [2022-12-13 02:13:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:13:53,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682910427] [2022-12-13 02:13:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:13:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 02:13:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:13:54,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682910427] [2022-12-13 02:13:54,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682910427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:13:54,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:13:54,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:13:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186437396] [2022-12-13 02:13:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:13:54,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:13:54,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:13:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:13:54,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:13:54,046 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:13:54,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 194 transitions, 3508 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) 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 02:13:54,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:13:54,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:13:54,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:13:57,076 INFO L130 PetriNetUnfolder]: 13142/18716 cut-off events. [2022-12-13 02:13:57,076 INFO L131 PetriNetUnfolder]: For 717963/717963 co-relation queries the response was YES. [2022-12-13 02:13:57,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161616 conditions, 18716 events. 13142/18716 cut-off events. For 717963/717963 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 106809 event pairs, 2512 based on Foata normal form. 129/18843 useless extension candidates. Maximal degree in co-relation 161438. Up to 8999 conditions per place. [2022-12-13 02:13:57,345 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 270 selfloop transitions, 3 changer transitions 84/357 dead transitions. [2022-12-13 02:13:57,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 357 transitions, 6636 flow [2022-12-13 02:13:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:13:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:13:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-13 02:13:57,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-13 02:13:57,346 INFO L175 Difference]: Start difference. First operand has 169 places, 194 transitions, 3508 flow. Second operand 7 states and 87 transitions. [2022-12-13 02:13:57,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 357 transitions, 6636 flow [2022-12-13 02:13:58,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 357 transitions, 6171 flow, removed 200 selfloop flow, removed 26 redundant places. [2022-12-13 02:13:58,238 INFO L231 Difference]: Finished difference. Result has 153 places, 195 transitions, 3279 flow [2022-12-13 02:13:58,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3205, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3279, PETRI_PLACES=153, PETRI_TRANSITIONS=195} [2022-12-13 02:13:58,239 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 113 predicate places. [2022-12-13 02:13:58,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:13:58,239 INFO L89 Accepts]: Start accepts. Operand has 153 places, 195 transitions, 3279 flow [2022-12-13 02:13:58,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:13:58,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:13:58,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 195 transitions, 3279 flow [2022-12-13 02:13:58,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 195 transitions, 3279 flow [2022-12-13 02:13:58,638 INFO L130 PetriNetUnfolder]: 1380/2864 cut-off events. [2022-12-13 02:13:58,638 INFO L131 PetriNetUnfolder]: For 60263/60923 co-relation queries the response was YES. [2022-12-13 02:13:58,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22401 conditions, 2864 events. 1380/2864 cut-off events. For 60263/60923 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19874 event pairs, 236 based on Foata normal form. 8/2819 useless extension candidates. Maximal degree in co-relation 22326. Up to 1269 conditions per place. [2022-12-13 02:13:58,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 195 transitions, 3279 flow [2022-12-13 02:13:58,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 1540 [2022-12-13 02:14:00,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:14:00,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2371 [2022-12-13 02:14:00,610 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 194 transitions, 3275 flow [2022-12-13 02:14:00,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) 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 02:14:00,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:14:00,610 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 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 02:14:00,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 02:14:00,611 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:14:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:14:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 797302545, now seen corresponding path program 1 times [2022-12-13 02:14:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:14:00,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326410052] [2022-12-13 02:14:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:00,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:14:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:14:00,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:14:00,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326410052] [2022-12-13 02:14:00,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326410052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:14:00,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679913242] [2022-12-13 02:14:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:00,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:14:00,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:14:00,704 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 02:14:00,716 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 02:14:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:00,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:14:00,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:14:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:14:00,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:14:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:14:00,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679913242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:14:00,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:14:00,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-12-13 02:14:00,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603705160] [2022-12-13 02:14:00,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:14:00,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:14:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:14:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:14:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:14:00,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:14:00,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 194 transitions, 3275 flow. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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 02:14:00,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:14:00,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:14:00,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:14:03,402 INFO L130 PetriNetUnfolder]: 12210/17186 cut-off events. [2022-12-13 02:14:03,402 INFO L131 PetriNetUnfolder]: For 370843/370843 co-relation queries the response was YES. [2022-12-13 02:14:03,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137275 conditions, 17186 events. 12210/17186 cut-off events. For 370843/370843 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 95083 event pairs, 2220 based on Foata normal form. 1150/18335 useless extension candidates. Maximal degree in co-relation 137198. Up to 7647 conditions per place. [2022-12-13 02:14:03,535 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 357 selfloop transitions, 35 changer transitions 1/393 dead transitions. [2022-12-13 02:14:03,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 393 transitions, 7533 flow [2022-12-13 02:14:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:14:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:14:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-13 02:14:03,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2022-12-13 02:14:03,536 INFO L175 Difference]: Start difference. First operand has 149 places, 194 transitions, 3275 flow. Second operand 6 states and 91 transitions. [2022-12-13 02:14:03,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 393 transitions, 7533 flow [2022-12-13 02:14:04,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 393 transitions, 7287 flow, removed 121 selfloop flow, removed 7 redundant places. [2022-12-13 02:14:04,232 INFO L231 Difference]: Finished difference. Result has 147 places, 191 transitions, 3237 flow [2022-12-13 02:14:04,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3137, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3237, PETRI_PLACES=147, PETRI_TRANSITIONS=191} [2022-12-13 02:14:04,233 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 107 predicate places. [2022-12-13 02:14:04,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:14:04,233 INFO L89 Accepts]: Start accepts. Operand has 147 places, 191 transitions, 3237 flow [2022-12-13 02:14:04,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:14:04,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:14:04,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 191 transitions, 3237 flow [2022-12-13 02:14:04,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 191 transitions, 3237 flow [2022-12-13 02:14:04,516 INFO L130 PetriNetUnfolder]: 1421/2788 cut-off events. [2022-12-13 02:14:04,516 INFO L131 PetriNetUnfolder]: For 61105/61848 co-relation queries the response was YES. [2022-12-13 02:14:04,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23957 conditions, 2788 events. 1421/2788 cut-off events. For 61105/61848 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 18629 event pairs, 265 based on Foata normal form. 11/2735 useless extension candidates. Maximal degree in co-relation 20398. Up to 1405 conditions per place. [2022-12-13 02:14:04,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 191 transitions, 3237 flow [2022-12-13 02:14:04,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 1536 [2022-12-13 02:14:04,563 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:14:04,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-13 02:14:04,564 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 191 transitions, 3237 flow [2022-12-13 02:14:04,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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 02:14:04,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:14:04,564 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 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 02:14:04,569 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 02:14:04,766 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,SelfDestructingSolverStorable23 [2022-12-13 02:14:04,766 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:14:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:14:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash -151186556, now seen corresponding path program 2 times [2022-12-13 02:14:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:14:04,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31769796] [2022-12-13 02:14:04,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:14:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:14:04,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31769796] [2022-12-13 02:14:04,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31769796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:14:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705327716] [2022-12-13 02:14:04,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:14:04,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:14:04,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:14:04,856 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 02:14:04,858 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 02:14:05,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:14:05,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:14:05,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:14:05,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:14:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:05,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:14:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:05,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705327716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:14:05,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:14:05,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 02:14:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996804079] [2022-12-13 02:14:05,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:14:05,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:14:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:14:05,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:14:05,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:14:05,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:14:05,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 191 transitions, 3237 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:14:05,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:14:05,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:14:05,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:14:08,066 INFO L130 PetriNetUnfolder]: 14480/20284 cut-off events. [2022-12-13 02:14:08,066 INFO L131 PetriNetUnfolder]: For 461896/461896 co-relation queries the response was YES. [2022-12-13 02:14:08,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164836 conditions, 20284 events. 14480/20284 cut-off events. For 461896/461896 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 111436 event pairs, 4309 based on Foata normal form. 828/21111 useless extension candidates. Maximal degree in co-relation 146335. Up to 13344 conditions per place. [2022-12-13 02:14:08,235 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 215 selfloop transitions, 34 changer transitions 1/250 dead transitions. [2022-12-13 02:14:08,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 250 transitions, 4825 flow [2022-12-13 02:14:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:14:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:14:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 02:14:08,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-13 02:14:08,236 INFO L175 Difference]: Start difference. First operand has 147 places, 191 transitions, 3237 flow. Second operand 5 states and 57 transitions. [2022-12-13 02:14:08,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 250 transitions, 4825 flow [2022-12-13 02:14:08,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 250 transitions, 4713 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 02:14:08,859 INFO L231 Difference]: Finished difference. Result has 148 places, 194 transitions, 3297 flow [2022-12-13 02:14:08,859 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3171, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3297, PETRI_PLACES=148, PETRI_TRANSITIONS=194} [2022-12-13 02:14:08,859 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 108 predicate places. [2022-12-13 02:14:08,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:14:08,860 INFO L89 Accepts]: Start accepts. Operand has 148 places, 194 transitions, 3297 flow [2022-12-13 02:14:08,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:14:08,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:14:08,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 194 transitions, 3297 flow [2022-12-13 02:14:08,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 194 transitions, 3297 flow [2022-12-13 02:14:09,307 INFO L130 PetriNetUnfolder]: 1684/3257 cut-off events. [2022-12-13 02:14:09,308 INFO L131 PetriNetUnfolder]: For 77107/78155 co-relation queries the response was YES. [2022-12-13 02:14:09,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28324 conditions, 3257 events. 1684/3257 cut-off events. For 77107/78155 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22130 event pairs, 342 based on Foata normal form. 32/3181 useless extension candidates. Maximal degree in co-relation 24306. Up to 1657 conditions per place. [2022-12-13 02:14:09,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 194 transitions, 3297 flow [2022-12-13 02:14:09,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 1604 [2022-12-13 02:14:09,373 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:14:09,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 514 [2022-12-13 02:14:09,374 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 194 transitions, 3297 flow [2022-12-13 02:14:09,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:14:09,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:14:09,374 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 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 02:14:09,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 02:14:09,579 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,SelfDestructingSolverStorable24 [2022-12-13 02:14:09,580 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:14:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:14:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1328851204, now seen corresponding path program 1 times [2022-12-13 02:14:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:14:09,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143236766] [2022-12-13 02:14:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:14:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:09,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:14:09,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143236766] [2022-12-13 02:14:09,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143236766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:14:09,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561501631] [2022-12-13 02:14:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:09,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:14:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:14:09,676 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 02:14:09,684 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 02:14:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:09,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:14:09,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:14:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:09,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:14:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:09,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561501631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:14:09,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:14:09,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-12-13 02:14:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809458110] [2022-12-13 02:14:09,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:14:09,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:14:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:14:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:14:09,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:14:09,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:14:09,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 194 transitions, 3297 flow. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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 02:14:09,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:14:09,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:14:09,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:14:13,064 INFO L130 PetriNetUnfolder]: 15118/21146 cut-off events. [2022-12-13 02:14:13,064 INFO L131 PetriNetUnfolder]: For 469811/469811 co-relation queries the response was YES. [2022-12-13 02:14:13,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172739 conditions, 21146 events. 15118/21146 cut-off events. For 469811/469811 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 116886 event pairs, 4328 based on Foata normal form. 224/21369 useless extension candidates. Maximal degree in co-relation 154636. Up to 13284 conditions per place. [2022-12-13 02:14:13,246 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 239 selfloop transitions, 37 changer transitions 1/277 dead transitions. [2022-12-13 02:14:13,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 277 transitions, 5307 flow [2022-12-13 02:14:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:14:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:14:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-13 02:14:13,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3101851851851852 [2022-12-13 02:14:13,247 INFO L175 Difference]: Start difference. First operand has 148 places, 194 transitions, 3297 flow. Second operand 6 states and 67 transitions. [2022-12-13 02:14:13,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 277 transitions, 5307 flow [2022-12-13 02:14:13,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 277 transitions, 5225 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 02:14:13,949 INFO L231 Difference]: Finished difference. Result has 151 places, 197 transitions, 3350 flow [2022-12-13 02:14:13,949 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3221, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3350, PETRI_PLACES=151, PETRI_TRANSITIONS=197} [2022-12-13 02:14:13,950 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2022-12-13 02:14:13,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:14:13,950 INFO L89 Accepts]: Start accepts. Operand has 151 places, 197 transitions, 3350 flow [2022-12-13 02:14:13,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:14:13,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:14:13,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 197 transitions, 3350 flow [2022-12-13 02:14:13,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 197 transitions, 3350 flow [2022-12-13 02:14:14,401 INFO L130 PetriNetUnfolder]: 1776/3394 cut-off events. [2022-12-13 02:14:14,401 INFO L131 PetriNetUnfolder]: For 81336/82376 co-relation queries the response was YES. [2022-12-13 02:14:14,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29914 conditions, 3394 events. 1776/3394 cut-off events. For 81336/82376 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 22968 event pairs, 344 based on Foata normal form. 39/3313 useless extension candidates. Maximal degree in co-relation 25748. Up to 1761 conditions per place. [2022-12-13 02:14:14,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 197 transitions, 3350 flow [2022-12-13 02:14:14,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 1654 [2022-12-13 02:14:14,464 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:14:14,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 514 [2022-12-13 02:14:14,464 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 197 transitions, 3350 flow [2022-12-13 02:14:14,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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 02:14:14,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:14:14,465 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 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 02:14:14,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 02:14:14,670 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,SelfDestructingSolverStorable25 [2022-12-13 02:14:14,670 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:14:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:14:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1549582350, now seen corresponding path program 1 times [2022-12-13 02:14:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:14:14,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107886558] [2022-12-13 02:14:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:14:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:14:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107886558] [2022-12-13 02:14:15,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107886558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:14:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293353628] [2022-12-13 02:14:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:14:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:14:15,077 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 02:14:15,079 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 02:14:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:15,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 02:14:15,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:14:15,291 INFO L321 Elim1Store]: treesize reduction 35, result has 7.9 percent of original size [2022-12-13 02:14:15,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 24 [2022-12-13 02:14:15,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 02:14:15,338 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-13 02:14:15,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 02:14:15,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 02:14:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:15,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:14:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:14:17,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293353628] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:14:17,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:14:17,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 02:14:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565927899] [2022-12-13 02:14:17,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:14:17,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 02:14:17,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:14:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 02:14:17,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-13 02:14:17,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:14:17,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 197 transitions, 3350 flow. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 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 02:14:17,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:14:17,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:14:17,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:14:22,786 INFO L130 PetriNetUnfolder]: 25788/35705 cut-off events. [2022-12-13 02:14:22,786 INFO L131 PetriNetUnfolder]: For 819904/819904 co-relation queries the response was YES. [2022-12-13 02:14:23,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297150 conditions, 35705 events. 25788/35705 cut-off events. For 819904/819904 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 209189 event pairs, 7120 based on Foata normal form. 7/35711 useless extension candidates. Maximal degree in co-relation 265267. Up to 20435 conditions per place. [2022-12-13 02:14:23,110 INFO L137 encePairwiseOnDemand]: 23/36 looper letters, 206 selfloop transitions, 29 changer transitions 319/554 dead transitions. [2022-12-13 02:14:23,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 554 transitions, 9736 flow [2022-12-13 02:14:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:14:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:14:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2022-12-13 02:14:23,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39646464646464646 [2022-12-13 02:14:23,111 INFO L175 Difference]: Start difference. First operand has 151 places, 197 transitions, 3350 flow. Second operand 11 states and 157 transitions. [2022-12-13 02:14:23,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 554 transitions, 9736 flow [2022-12-13 02:14:25,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 554 transitions, 9402 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-12-13 02:14:25,140 INFO L231 Difference]: Finished difference. Result has 161 places, 199 transitions, 3395 flow [2022-12-13 02:14:25,140 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3262, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3395, PETRI_PLACES=161, PETRI_TRANSITIONS=199} [2022-12-13 02:14:25,140 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 121 predicate places. [2022-12-13 02:14:25,140 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:14:25,140 INFO L89 Accepts]: Start accepts. Operand has 161 places, 199 transitions, 3395 flow [2022-12-13 02:14:25,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:14:25,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:14:25,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 199 transitions, 3395 flow [2022-12-13 02:14:25,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 199 transitions, 3395 flow [2022-12-13 02:14:25,572 INFO L130 PetriNetUnfolder]: 1758/3368 cut-off events. [2022-12-13 02:14:25,572 INFO L131 PetriNetUnfolder]: For 86797/87826 co-relation queries the response was YES. [2022-12-13 02:14:25,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29889 conditions, 3368 events. 1758/3368 cut-off events. For 86797/87826 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22741 event pairs, 346 based on Foata normal form. 41/3297 useless extension candidates. Maximal degree in co-relation 29786. Up to 1725 conditions per place. [2022-12-13 02:14:25,637 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 199 transitions, 3395 flow [2022-12-13 02:14:25,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 1666 [2022-12-13 02:14:25,642 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:14:25,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 503 [2022-12-13 02:14:25,643 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 199 transitions, 3395 flow [2022-12-13 02:14:25,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 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 02:14:25,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:14:25,643 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 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 02:14:25,652 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 02:14:25,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:14:25,849 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:14:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:14:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash 341731806, now seen corresponding path program 2 times [2022-12-13 02:14:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:14:25,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121056103] [2022-12-13 02:14:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:14:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:14:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:14:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 02:14:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:14:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121056103] [2022-12-13 02:14:27,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121056103] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:14:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856376404] [2022-12-13 02:14:27,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:14:27,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:14:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:14:27,504 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 02:14:27,506 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 02:14:27,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:14:27,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:14:27,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 02:14:27,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:14:27,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:14:27,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2022-12-13 02:14:27,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:14:27,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 02:14:27,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:14:27,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 02:14:28,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:14:28,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 02:14:28,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:14:28,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 93 [2022-12-13 02:14:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:14:28,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:15:12,850 WARN L233 SmtUtils]: Spent 43.40s on a formula simplification. DAG size of input: 229 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:15:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 02:15:12,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856376404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:15:12,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:15:12,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 7] total 31 [2022-12-13 02:15:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383860532] [2022-12-13 02:15:12,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:15:12,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 02:15:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 02:15:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-12-13 02:15:12,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:15:12,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 199 transitions, 3395 flow. Second operand has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 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 02:15:12,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:12,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:15:12,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:25,589 INFO L130 PetriNetUnfolder]: 37278/51763 cut-off events. [2022-12-13 02:15:25,589 INFO L131 PetriNetUnfolder]: For 1220471/1220471 co-relation queries the response was YES. [2022-12-13 02:15:26,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430558 conditions, 51763 events. 37278/51763 cut-off events. For 1220471/1220471 co-relation queries the response was YES. Maximal size of possible extension queue 1923. Compared 318806 event pairs, 3406 based on Foata normal form. 27/51789 useless extension candidates. Maximal degree in co-relation 430429. Up to 20246 conditions per place. [2022-12-13 02:15:26,624 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 278 selfloop transitions, 67 changer transitions 845/1190 dead transitions. [2022-12-13 02:15:26,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1190 transitions, 19891 flow [2022-12-13 02:15:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 02:15:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-13 02:15:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 518 transitions. [2022-12-13 02:15:26,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32702020202020204 [2022-12-13 02:15:26,633 INFO L175 Difference]: Start difference. First operand has 158 places, 199 transitions, 3395 flow. Second operand 44 states and 518 transitions. [2022-12-13 02:15:26,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1190 transitions, 19891 flow [2022-12-13 02:15:31,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1190 transitions, 19600 flow, removed 113 selfloop flow, removed 9 redundant places. [2022-12-13 02:15:31,151 INFO L231 Difference]: Finished difference. Result has 227 places, 216 transitions, 4190 flow [2022-12-13 02:15:31,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3302, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4190, PETRI_PLACES=227, PETRI_TRANSITIONS=216} [2022-12-13 02:15:31,151 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 187 predicate places. [2022-12-13 02:15:31,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:31,151 INFO L89 Accepts]: Start accepts. Operand has 227 places, 216 transitions, 4190 flow [2022-12-13 02:15:31,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:31,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:31,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 216 transitions, 4190 flow [2022-12-13 02:15:31,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 216 transitions, 4190 flow [2022-12-13 02:15:31,746 INFO L130 PetriNetUnfolder]: 1848/3720 cut-off events. [2022-12-13 02:15:31,746 INFO L131 PetriNetUnfolder]: For 224915/226216 co-relation queries the response was YES. [2022-12-13 02:15:31,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41578 conditions, 3720 events. 1848/3720 cut-off events. For 224915/226216 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26634 event pairs, 345 based on Foata normal form. 37/3627 useless extension candidates. Maximal degree in co-relation 41355. Up to 1843 conditions per place. [2022-12-13 02:15:31,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 216 transitions, 4190 flow [2022-12-13 02:15:31,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 1818 [2022-12-13 02:15:31,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 02:15:32,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:32,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 913 [2022-12-13 02:15:32,064 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 216 transitions, 4217 flow [2022-12-13 02:15:32,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 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 02:15:32,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:32,064 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 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 02:15:32,075 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 02:15:32,269 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,SelfDestructingSolverStorable27 [2022-12-13 02:15:32,270 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 02:15:32,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1958836426, now seen corresponding path program 3 times [2022-12-13 02:15:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:32,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994636472] [2022-12-13 02:15:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:15:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994636472] [2022-12-13 02:15:32,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994636472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:15:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759221768] [2022-12-13 02:15:32,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 02:15:32,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:15:32,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:15:32,652 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 02:15:32,654 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 02:15:33,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 02:15:33,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:15:33,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 02:15:33,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:15:33,085 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-13 02:15:33,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 02:15:33,107 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-13 02:15:33,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 02:15:33,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 02:15:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:15:33,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:15:33,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-12-13 02:15:33,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 129 [2022-12-13 02:15:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 02:15:33,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759221768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:15:33,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:15:33,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-13 02:15:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110904019] [2022-12-13 02:15:33,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:15:33,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 02:15:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:33,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 02:15:33,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-12-13 02:15:33,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 02:15:33,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 216 transitions, 4217 flow. Second operand has 21 states, 20 states have (on average 3.95) internal successors, (79), 21 states have internal predecessors, (79), 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 02:15:33,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:33,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 02:15:33,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand