/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-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:07:17,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:07:17,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:07:17,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:07:17,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:07:17,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:07:17,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:07:17,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:07:17,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:07:17,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:07:17,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:07:17,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:07:17,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:07:17,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:07:17,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:07:17,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:07:17,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:07:17,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:07:17,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:07:17,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:07:17,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:07:17,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:07:17,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:07:17,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:07:17,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:07:17,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:07:17,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:07:17,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:07:17,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:07:17,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:07:17,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:07:17,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:07:17,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:07:17,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:07:17,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:07:17,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:07:17,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:07:17,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:07:17,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:07:17,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:07:17,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:07:17,134 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:07:17,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:07:17,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:07:17,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:07:17,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:07:17,160 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:07:17,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:07:17,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:07:17,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:07:17,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:07:17,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:07:17,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:07:17,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:07:17,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:07:17,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:07:17,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:07:17,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:07:17,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:07:17,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:07:17,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:07:17,163 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:07:17,163 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:07:17,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:07:17,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:07:17,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:07:17,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:07:17,419 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:07:17,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-13 02:07:18,267 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:07:18,442 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:07:18,442 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-13 02:07:18,446 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61fde426b/4a7cdce36db049d0bdf5e45a86c0945b/FLAG9c15beae6 [2022-12-13 02:07:18,455 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61fde426b/4a7cdce36db049d0bdf5e45a86c0945b [2022-12-13 02:07:18,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:07:18,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:07:18,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:07:18,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:07:18,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:07:18,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e223f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18, skipping insertion in model container [2022-12-13 02:07:18,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:07:18,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:07:18,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,624 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-more-dec-subseq.wvr.c[2924,2937] [2022-12-13 02:07:18,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:07:18,647 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:07:18,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:07:18,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:07:18,687 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-more-dec-subseq.wvr.c[2924,2937] [2022-12-13 02:07:18,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:07:18,700 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:07:18,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18 WrapperNode [2022-12-13 02:07:18,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:07:18,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:07:18,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:07:18,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:07:18,711 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:07:18" (1/1) ... [2022-12-13 02:07:18,726 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:07:18" (1/1) ... [2022-12-13 02:07:18,755 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-13 02:07:18,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:07:18,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:07:18,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:07:18,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:07:18,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:07:18,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:07:18,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:07:18,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:07:18,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (1/1) ... [2022-12-13 02:07:18,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:07:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:07:18,857 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:07:18,930 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:07:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:07:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:07:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:07:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:07:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:07:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:07:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:07:18,942 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:07:19,018 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:07:19,019 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:07:19,322 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:07:19,447 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:07:19,447 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 02:07:19,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:07:19 BoogieIcfgContainer [2022-12-13 02:07:19,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:07:19,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:07:19,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:07:19,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:07:19,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:07:18" (1/3) ... [2022-12-13 02:07:19,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1bb93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:07:19, skipping insertion in model container [2022-12-13 02:07:19,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:07:18" (2/3) ... [2022-12-13 02:07:19,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1bb93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:07:19, skipping insertion in model container [2022-12-13 02:07:19,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:07:19" (3/3) ... [2022-12-13 02:07:19,456 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-12-13 02:07:19,470 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:07:19,470 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:07:19,470 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:07:19,522 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:07:19,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-13 02:07:19,635 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-13 02:07:19,636 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:07:19,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 02:07:19,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-13 02:07:19,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-13 02:07:19,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:19,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-13 02:07:19,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-13 02:07:19,694 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-13 02:07:19,694 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:07:19,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 02:07:19,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-13 02:07:19,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 02:07:24,725 INFO L241 LiptonReduction]: Total number of compositions: 140 [2022-12-13 02:07:24,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:07:24,741 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;@55975aa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:07:24,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 02:07:24,747 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-13 02:07:24,747 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:07:24,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:24,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:24,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-13 02:07:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:24,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349180599] [2022-12-13 02:07:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,083 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:07:25,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349180599] [2022-12-13 02:07:25,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349180599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:25,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:25,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819251011] [2022-12-13 02:07:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:07:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:07:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:07:25,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:07:25,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:07:25,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:25,181 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-13 02:07:25,181 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 02:07:25,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-13 02:07:25,184 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-13 02:07:25,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-13 02:07:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:07:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:07:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 02:07:25,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-13 02:07:25,193 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-13 02:07:25,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-13 02:07:25,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:25,196 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-13 02:07:25,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-13 02:07:25,200 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-13 02:07:25,200 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,201 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 71 flow [2022-12-13 02:07:25,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-13 02:07:25,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 71 flow [2022-12-13 02:07:25,207 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-13 02:07:25,207 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:07:25,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 29 events. 6/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 6 conditions per place. [2022-12-13 02:07:25,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-13 02:07:25,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 02:07:25,220 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:07:25,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 02:07:25,222 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-13 02:07:25,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:25,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:07:25,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-13 02:07:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:25,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610737120] [2022-12-13 02:07:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610737120] [2022-12-13 02:07:25,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610737120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:25,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:25,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:07:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631465160] [2022-12-13 02:07:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:25,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:25,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:25,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:07:25,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:07:25,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:25,422 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-13 02:07:25,422 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 02:07:25,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 38 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 182. Up to 153 conditions per place. [2022-12-13 02:07:25,423 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-13 02:07:25,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-13 02:07:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:07:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:07:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 02:07:25,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-13 02:07:25,425 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-13 02:07:25,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-13 02:07:25,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 02:07:25,426 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-13 02:07:25,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-13 02:07:25,426 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-13 02:07:25,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,427 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 84 flow [2022-12-13 02:07:25,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-13 02:07:25,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 84 flow [2022-12-13 02:07:25,431 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-13 02:07:25,431 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:07:25,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-13 02:07:25,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-13 02:07:25,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 02:07:25,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:25,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-13 02:07:25,685 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 80 flow [2022-12-13 02:07:25,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:25,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:25,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:07:25,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1878813032, now seen corresponding path program 1 times [2022-12-13 02:07:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:25,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599792475] [2022-12-13 02:07:25,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599792475] [2022-12-13 02:07:25,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599792475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:25,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:25,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:07:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233939712] [2022-12-13 02:07:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:07:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:07:25,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:07:25,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:07:25,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:07:25,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:25,944 INFO L130 PetriNetUnfolder]: 228/381 cut-off events. [2022-12-13 02:07:25,944 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 02:07:25,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 381 events. 228/381 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1410 event pairs, 40 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 858. Up to 212 conditions per place. [2022-12-13 02:07:25,946 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-13 02:07:25,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 266 flow [2022-12-13 02:07:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 02:07:25,947 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-13 02:07:25,947 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 80 flow. Second operand 5 states and 48 transitions. [2022-12-13 02:07:25,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 266 flow [2022-12-13 02:07:25,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 52 transitions, 244 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 02:07:25,949 INFO L231 Difference]: Finished difference. Result has 30 places, 39 transitions, 181 flow [2022-12-13 02:07:25,949 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=30, PETRI_TRANSITIONS=39} [2022-12-13 02:07:25,950 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-13 02:07:25,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,950 INFO L89 Accepts]: Start accepts. Operand has 30 places, 39 transitions, 181 flow [2022-12-13 02:07:25,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-13 02:07:25,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 39 transitions, 181 flow [2022-12-13 02:07:25,957 INFO L130 PetriNetUnfolder]: 29/82 cut-off events. [2022-12-13 02:07:25,958 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 02:07:25,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 82 events. 29/82 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 168. Up to 28 conditions per place. [2022-12-13 02:07:25,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-13 02:07:25,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 02:07:25,998 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:07:25,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 02:07:25,999 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 39 transitions, 181 flow [2022-12-13 02:07:25,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:25,999 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:25,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:07:25,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:25,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1128489956, now seen corresponding path program 2 times [2022-12-13 02:07:25,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:26,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958886675] [2022-12-13 02:07:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,071 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:07:26,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:26,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958886675] [2022-12-13 02:07:26,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958886675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:26,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:26,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 02:07:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836250030] [2022-12-13 02:07:26,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:26,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:07:26,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:26,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:07:26,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:07:26,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 02:07:26,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 39 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:26,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 02:07:26,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:26,135 INFO L130 PetriNetUnfolder]: 296/490 cut-off events. [2022-12-13 02:07:26,135 INFO L131 PetriNetUnfolder]: For 453/462 co-relation queries the response was YES. [2022-12-13 02:07:26,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 490 events. 296/490 cut-off events. For 453/462 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1909 event pairs, 100 based on Foata normal form. 5/449 useless extension candidates. Maximal degree in co-relation 874. Up to 263 conditions per place. [2022-12-13 02:07:26,137 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 46 selfloop transitions, 5 changer transitions 2/55 dead transitions. [2022-12-13 02:07:26,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 358 flow [2022-12-13 02:07:26,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:07:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:07:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-13 02:07:26,138 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-13 02:07:26,138 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 181 flow. Second operand 3 states and 39 transitions. [2022-12-13 02:07:26,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 358 flow [2022-12-13 02:07:26,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 354 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 02:07:26,141 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 207 flow [2022-12-13 02:07:26,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2022-12-13 02:07:26,141 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-13 02:07:26,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:26,142 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 207 flow [2022-12-13 02:07:26,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:26,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:26,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-13 02:07:26,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 41 transitions, 207 flow [2022-12-13 02:07:26,150 INFO L130 PetriNetUnfolder]: 37/101 cut-off events. [2022-12-13 02:07:26,150 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 02:07:26,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 101 events. 37/101 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2022-12-13 02:07:26,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-13 02:07:26,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 02:07:26,158 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:07:26,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 02:07:26,159 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 207 flow [2022-12-13 02:07:26,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:26,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:26,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:07:26,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1026730500, now seen corresponding path program 1 times [2022-12-13 02:07:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:26,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353903048] [2022-12-13 02:07:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,290 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:07:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:26,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353903048] [2022-12-13 02:07:26,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353903048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:07:26,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898717592] [2022-12-13 02:07:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:26,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:07:26,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:07:26,293 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:07:26,323 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:07:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:07:26,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:07:26,401 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:07:26,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:07:26,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898717592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:26,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:07:26,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-13 02:07:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472049151] [2022-12-13 02:07:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:26,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:07:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:26,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:07:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:07:26,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:07:26,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:26,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:07:26,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:26,480 INFO L130 PetriNetUnfolder]: 304/527 cut-off events. [2022-12-13 02:07:26,480 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-13 02:07:26,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 527 events. 304/527 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2076 event pairs, 82 based on Foata normal form. 30/524 useless extension candidates. Maximal degree in co-relation 1085. Up to 374 conditions per place. [2022-12-13 02:07:26,482 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 5/57 dead transitions. [2022-12-13 02:07:26,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 389 flow [2022-12-13 02:07:26,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:07:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:07:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-13 02:07:26,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-13 02:07:26,483 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 207 flow. Second operand 3 states and 37 transitions. [2022-12-13 02:07:26,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 389 flow [2022-12-13 02:07:26,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:07:26,485 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 214 flow [2022-12-13 02:07:26,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=35, PETRI_TRANSITIONS=41} [2022-12-13 02:07:26,486 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-13 02:07:26,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:26,486 INFO L89 Accepts]: Start accepts. Operand has 35 places, 41 transitions, 214 flow [2022-12-13 02:07:26,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:26,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:26,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-13 02:07:26,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 41 transitions, 214 flow [2022-12-13 02:07:26,497 INFO L130 PetriNetUnfolder]: 37/114 cut-off events. [2022-12-13 02:07:26,497 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 02:07:26,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 114 events. 37/114 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 429 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 263. Up to 33 conditions per place. [2022-12-13 02:07:26,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-13 02:07:26,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 02:07:26,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:07:26,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 02:07:26,499 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 214 flow [2022-12-13 02:07:26,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:26,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:26,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 02:07:26,704 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:07:26,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:26,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271914, now seen corresponding path program 1 times [2022-12-13 02:07:26,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:26,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748156852] [2022-12-13 02:07:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,799 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:07:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:26,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748156852] [2022-12-13 02:07:26,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748156852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:26,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060265443] [2022-12-13 02:07:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:26,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:07:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:07:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:07:26,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 02:07:26,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:07:26,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:26,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 02:07:26,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:26,897 INFO L130 PetriNetUnfolder]: 344/631 cut-off events. [2022-12-13 02:07:26,897 INFO L131 PetriNetUnfolder]: For 799/816 co-relation queries the response was YES. [2022-12-13 02:07:26,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 631 events. 344/631 cut-off events. For 799/816 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2836 event pairs, 212 based on Foata normal form. 33/601 useless extension candidates. Maximal degree in co-relation 1467. Up to 476 conditions per place. [2022-12-13 02:07:26,899 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 38 selfloop transitions, 2 changer transitions 20/62 dead transitions. [2022-12-13 02:07:26,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 424 flow [2022-12-13 02:07:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:07:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:07:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 02:07:26,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-13 02:07:26,901 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 214 flow. Second operand 4 states and 43 transitions. [2022-12-13 02:07:26,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 424 flow [2022-12-13 02:07:26,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:07:26,905 INFO L231 Difference]: Finished difference. Result has 39 places, 42 transitions, 226 flow [2022-12-13 02:07:26,905 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=42} [2022-12-13 02:07:26,907 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-13 02:07:26,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:26,907 INFO L89 Accepts]: Start accepts. Operand has 39 places, 42 transitions, 226 flow [2022-12-13 02:07:26,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:26,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:26,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 42 transitions, 226 flow [2022-12-13 02:07:26,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 226 flow [2022-12-13 02:07:26,916 INFO L130 PetriNetUnfolder]: 37/115 cut-off events. [2022-12-13 02:07:26,916 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-13 02:07:26,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 115 events. 37/115 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 425 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 293. Up to 33 conditions per place. [2022-12-13 02:07:26,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 226 flow [2022-12-13 02:07:26,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 02:07:27,809 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:27,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 903 [2022-12-13 02:07:27,810 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 222 flow [2022-12-13 02:07:27,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:07:27,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:27,810 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:27,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:07:27,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:27,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 788331176, now seen corresponding path program 1 times [2022-12-13 02:07:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342363984] [2022-12-13 02:07:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:28,855 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:07:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:28,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342363984] [2022-12-13 02:07:28,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342363984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:07:28,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040534857] [2022-12-13 02:07:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:28,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:07:28,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:07:28,873 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:07:28,874 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:07:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:28,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 02:07:28,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:07:29,003 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:07:29,038 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 7 treesize of output 3 [2022-12-13 02:07:29,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:07:29,110 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 18 treesize of output 20 [2022-12-13 02:07:29,312 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 02:07:29,313 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 38 treesize of output 10 [2022-12-13 02:07:29,335 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:07:29,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:07:29,894 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-13 02:07:29,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 256 [2022-12-13 02:07:29,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:07:29,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-13 02:07:29,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:07:29,934 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 144 treesize of output 137 [2022-12-13 02:07:30,391 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:07:30,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040534857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:07:30,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:07:30,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-13 02:07:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851074443] [2022-12-13 02:07:30,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:07:30,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 02:07:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:30,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 02:07:30,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=465, Unknown=2, NotChecked=0, Total=600 [2022-12-13 02:07:30,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:07:30,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 222 flow. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 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:07:30,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:30,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:07:30,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:37,885 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 83 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:07:51,024 WARN L233 SmtUtils]: Spent 12.76s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:07:57,476 WARN L233 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:08:06,505 WARN L233 SmtUtils]: Spent 8.89s on a formula simplification. DAG size of input: 90 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:08:15,481 WARN L233 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 89 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:08:26,552 WARN L233 SmtUtils]: Spent 11.01s on a formula simplification. DAG size of input: 82 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:08:33,006 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 87 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:08:33,749 INFO L130 PetriNetUnfolder]: 1806/3179 cut-off events. [2022-12-13 02:08:33,749 INFO L131 PetriNetUnfolder]: For 3159/3159 co-relation queries the response was YES. [2022-12-13 02:08:33,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10725 conditions, 3179 events. 1806/3179 cut-off events. For 3159/3159 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19382 event pairs, 236 based on Foata normal form. 55/3013 useless extension candidates. Maximal degree in co-relation 10707. Up to 735 conditions per place. [2022-12-13 02:08:33,763 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 305 selfloop transitions, 138 changer transitions 93/536 dead transitions. [2022-12-13 02:08:33,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 536 transitions, 3655 flow [2022-12-13 02:08:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 02:08:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-13 02:08:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 413 transitions. [2022-12-13 02:08:33,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40810276679841895 [2022-12-13 02:08:33,768 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 222 flow. Second operand 44 states and 413 transitions. [2022-12-13 02:08:33,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 536 transitions, 3655 flow [2022-12-13 02:08:33,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 536 transitions, 3613 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-13 02:08:33,798 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 1691 flow [2022-12-13 02:08:33,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1691, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2022-12-13 02:08:33,799 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 80 predicate places. [2022-12-13 02:08:33,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:33,799 INFO L89 Accepts]: Start accepts. Operand has 105 places, 182 transitions, 1691 flow [2022-12-13 02:08:33,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:33,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:33,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 182 transitions, 1691 flow [2022-12-13 02:08:33,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 182 transitions, 1691 flow [2022-12-13 02:08:33,862 INFO L130 PetriNetUnfolder]: 271/765 cut-off events. [2022-12-13 02:08:33,862 INFO L131 PetriNetUnfolder]: For 4536/4598 co-relation queries the response was YES. [2022-12-13 02:08:33,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 765 events. 271/765 cut-off events. For 4536/4598 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5268 event pairs, 8 based on Foata normal form. 8/752 useless extension candidates. Maximal degree in co-relation 3286. Up to 220 conditions per place. [2022-12-13 02:08:33,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 182 transitions, 1691 flow [2022-12-13 02:08:33,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 02:08:37,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:08:42,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:08:47,335 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 02:08:47,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13537 [2022-12-13 02:08:47,336 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 179 transitions, 1722 flow [2022-12-13 02:08:47,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 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,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:47,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:47,342 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:47,541 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,SelfDestructingSolverStorable6 [2022-12-13 02:08:47,542 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash 740048829, now seen corresponding path program 1 times [2022-12-13 02:08:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:47,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260698399] [2022-12-13 02:08:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:47,654 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:08:47,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:47,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260698399] [2022-12-13 02:08:47,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260698399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:47,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150679983] [2022-12-13 02:08:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:47,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:47,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:47,656 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:47,658 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:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:47,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 02:08:47,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:47,756 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:08:47,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:08:47,815 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:08:47,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150679983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:08:47,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:08:47,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-13 02:08:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914064152] [2022-12-13 02:08:47,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:08:47,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:08:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:47,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:08:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:08:47,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:08:47,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 179 transitions, 1722 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:47,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:08:47,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:48,243 INFO L130 PetriNetUnfolder]: 1465/2607 cut-off events. [2022-12-13 02:08:48,243 INFO L131 PetriNetUnfolder]: For 16159/16159 co-relation queries the response was YES. [2022-12-13 02:08:48,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12981 conditions, 2607 events. 1465/2607 cut-off events. For 16159/16159 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15000 event pairs, 239 based on Foata normal form. 66/2671 useless extension candidates. Maximal degree in co-relation 12877. Up to 798 conditions per place. [2022-12-13 02:08:48,260 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 141 selfloop transitions, 120 changer transitions 2/263 dead transitions. [2022-12-13 02:08:48,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 263 transitions, 2974 flow [2022-12-13 02:08:48,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:08:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:08:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 02:08:48,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3431372549019608 [2022-12-13 02:08:48,261 INFO L175 Difference]: Start difference. First operand has 97 places, 179 transitions, 1722 flow. Second operand 6 states and 70 transitions. [2022-12-13 02:08:48,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 263 transitions, 2974 flow [2022-12-13 02:08:48,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 263 transitions, 2659 flow, removed 128 selfloop flow, removed 7 redundant places. [2022-12-13 02:08:48,321 INFO L231 Difference]: Finished difference. Result has 99 places, 217 transitions, 2414 flow [2022-12-13 02:08:48,321 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2414, PETRI_PLACES=99, PETRI_TRANSITIONS=217} [2022-12-13 02:08:48,323 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 74 predicate places. [2022-12-13 02:08:48,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:48,324 INFO L89 Accepts]: Start accepts. Operand has 99 places, 217 transitions, 2414 flow [2022-12-13 02:08:48,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:48,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:48,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 217 transitions, 2414 flow [2022-12-13 02:08:48,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 217 transitions, 2414 flow [2022-12-13 02:08:48,399 INFO L130 PetriNetUnfolder]: 316/872 cut-off events. [2022-12-13 02:08:48,399 INFO L131 PetriNetUnfolder]: For 5253/5362 co-relation queries the response was YES. [2022-12-13 02:08:48,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4343 conditions, 872 events. 316/872 cut-off events. For 5253/5362 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5999 event pairs, 5 based on Foata normal form. 8/862 useless extension candidates. Maximal degree in co-relation 4300. Up to 259 conditions per place. [2022-12-13 02:08:48,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 217 transitions, 2414 flow [2022-12-13 02:08:48,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 830 [2022-12-13 02:08:48,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:08:48,839 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:08:48,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 516 [2022-12-13 02:08:48,841 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 218 transitions, 2435 flow [2022-12-13 02:08:48,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:48,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:48,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:48,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 02:08:49,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:49,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash 639549309, now seen corresponding path program 2 times [2022-12-13 02:08:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819843373] [2022-12-13 02:08:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:49,600 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:08:49,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819843373] [2022-12-13 02:08:49,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819843373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305055096] [2022-12-13 02:08:49,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:08:49,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:49,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:49,604 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:49,605 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:49,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:08:49,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:08:49,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:08:49,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:49,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:08:49,819 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 02:08:49,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 02:08:49,826 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 27 treesize of output 15 [2022-12-13 02:08:49,892 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 23 treesize of output 7 [2022-12-13 02:08:49,913 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:08:49,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:08:50,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:08:50,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-13 02:08:50,211 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 42 treesize of output 36 [2022-12-13 02:08:50,369 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:08:50,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305055096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:08:50,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:08:50,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:08:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066601623] [2022-12-13 02:08:50,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:08:50,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:08:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:08:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-12-13 02:08:50,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:08:50,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 218 transitions, 2435 flow. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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:50,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:50,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:08:50,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:52,710 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 [0] [2022-12-13 02:08:53,634 INFO L130 PetriNetUnfolder]: 2213/3890 cut-off events. [2022-12-13 02:08:53,634 INFO L131 PetriNetUnfolder]: For 24485/24485 co-relation queries the response was YES. [2022-12-13 02:08:53,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21017 conditions, 3890 events. 2213/3890 cut-off events. For 24485/24485 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 23474 event pairs, 393 based on Foata normal form. 11/3900 useless extension candidates. Maximal degree in co-relation 20970. Up to 1417 conditions per place. [2022-12-13 02:08:53,662 INFO L137 encePairwiseOnDemand]: 12/36 looper letters, 236 selfloop transitions, 167 changer transitions 31/434 dead transitions. [2022-12-13 02:08:53,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 434 transitions, 5399 flow [2022-12-13 02:08:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:08:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:08:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-12-13 02:08:53,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27380952380952384 [2022-12-13 02:08:53,664 INFO L175 Difference]: Start difference. First operand has 98 places, 218 transitions, 2435 flow. Second operand 14 states and 138 transitions. [2022-12-13 02:08:53,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 434 transitions, 5399 flow [2022-12-13 02:08:53,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 434 transitions, 5247 flow, removed 53 selfloop flow, removed 2 redundant places. [2022-12-13 02:08:53,869 INFO L231 Difference]: Finished difference. Result has 118 places, 310 transitions, 4095 flow [2022-12-13 02:08:53,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4095, PETRI_PLACES=118, PETRI_TRANSITIONS=310} [2022-12-13 02:08:53,870 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 93 predicate places. [2022-12-13 02:08:53,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:53,870 INFO L89 Accepts]: Start accepts. Operand has 118 places, 310 transitions, 4095 flow [2022-12-13 02:08:53,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:53,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:53,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 310 transitions, 4095 flow [2022-12-13 02:08:53,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 310 transitions, 4095 flow [2022-12-13 02:08:54,018 INFO L130 PetriNetUnfolder]: 461/1239 cut-off events. [2022-12-13 02:08:54,018 INFO L131 PetriNetUnfolder]: For 10115/10210 co-relation queries the response was YES. [2022-12-13 02:08:54,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7166 conditions, 1239 events. 461/1239 cut-off events. For 10115/10210 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8984 event pairs, 8 based on Foata normal form. 13/1241 useless extension candidates. Maximal degree in co-relation 7095. Up to 410 conditions per place. [2022-12-13 02:08:54,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 310 transitions, 4095 flow [2022-12-13 02:08:54,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 1216 [2022-12-13 02:08:54,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:08:56,708 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:08:56,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2839 [2022-12-13 02:08:56,709 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 309 transitions, 4103 flow [2022-12-13 02:08:56,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:56,709 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:56,730 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,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:56,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1773911980, now seen corresponding path program 1 times [2022-12-13 02:08:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:56,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939782970] [2022-12-13 02:08:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:57,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939782970] [2022-12-13 02:08:57,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939782970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:57,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:57,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:08:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334145426] [2022-12-13 02:08:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:57,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:57,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:57,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:08:57,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 309 transitions, 4103 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:57,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:57,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:08:57,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:57,624 INFO L130 PetriNetUnfolder]: 2012/3673 cut-off events. [2022-12-13 02:08:57,624 INFO L131 PetriNetUnfolder]: For 31983/31983 co-relation queries the response was YES. [2022-12-13 02:08:57,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22440 conditions, 3673 events. 2012/3673 cut-off events. For 31983/31983 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22849 event pairs, 451 based on Foata normal form. 184/3857 useless extension candidates. Maximal degree in co-relation 22353. Up to 1470 conditions per place. [2022-12-13 02:08:57,649 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 222 selfloop transitions, 113 changer transitions 0/335 dead transitions. [2022-12-13 02:08:57,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 335 transitions, 5076 flow [2022-12-13 02:08:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:08:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:08:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 02:08:57,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-13 02:08:57,651 INFO L175 Difference]: Start difference. First operand has 116 places, 309 transitions, 4103 flow. Second operand 4 states and 75 transitions. [2022-12-13 02:08:57,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 335 transitions, 5076 flow [2022-12-13 02:08:57,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 335 transitions, 4912 flow, removed 81 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:57,858 INFO L231 Difference]: Finished difference. Result has 115 places, 273 transitions, 4012 flow [2022-12-13 02:08:57,858 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3308, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4012, PETRI_PLACES=115, PETRI_TRANSITIONS=273} [2022-12-13 02:08:57,858 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 90 predicate places. [2022-12-13 02:08:57,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:57,858 INFO L89 Accepts]: Start accepts. Operand has 115 places, 273 transitions, 4012 flow [2022-12-13 02:08:57,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:57,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:57,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 273 transitions, 4012 flow [2022-12-13 02:08:57,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 273 transitions, 4012 flow [2022-12-13 02:08:57,991 INFO L130 PetriNetUnfolder]: 419/1260 cut-off events. [2022-12-13 02:08:57,992 INFO L131 PetriNetUnfolder]: For 10581/10674 co-relation queries the response was YES. [2022-12-13 02:08:57,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 1260 events. 419/1260 cut-off events. For 10581/10674 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9531 event pairs, 10 based on Foata normal form. 16/1262 useless extension candidates. Maximal degree in co-relation 6803. Up to 370 conditions per place. [2022-12-13 02:08:58,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 273 transitions, 4012 flow [2022-12-13 02:08:58,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 1058 [2022-12-13 02:08:58,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] $Ultimate##0-->L79: Formula: (and (= v_~new~0_64 v_~v_old~0_84) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~start~0_150 v_~end~0_196) (< v_~start~0_150 v_~n~0_112) (<= 0 v_~start~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= (+ v_~start~0_150 1) v_~start~0_149) (= |v_thread2Thread1of1ForFork1_~cond~0#1_72| (ite (= (ite (or (< v_~start~0_149 v_~end~0_196) (< v_~i~0_191 v_~N~0_161)) 1 0) 0) 0 1)) (= (ite (= 0 (ite (and (not (= (mod v_~ok~0_97 256) 0)) (<= v_~new~0_64 v_~v_old~0_85)) 1 0)) 0 1) v_~ok~0_96) (= v_~new~0_64 (select (select |v_#memory_int_267| v_~queue~0.base_108) (+ (* v_~start~0_150 4) v_~queue~0.offset_108)))) InVars {~start~0=v_~start~0_150, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_97, ~i~0=v_~i~0_191, #memory_int=|v_#memory_int_267|, ~end~0=v_~end~0_196, ~N~0=v_~N~0_161, ~v_old~0=v_~v_old~0_85, ~queue~0.base=v_~queue~0.base_108, ~n~0=v_~n~0_112} OutVars{~start~0=v_~start~0_149, ~new~0=v_~new~0_64, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_96, ~i~0=v_~i~0_191, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_161, ~queue~0.base=v_~queue~0.base_108, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_72|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_267|, ~end~0=v_~end~0_196, ~v_old~0=v_~v_old~0_84, ~n~0=v_~n~0_112} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:08:58,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:08:58,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] $Ultimate##0-->L79: Formula: (and (= v_~new~0_64 v_~v_old~0_84) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~start~0_150 v_~end~0_196) (< v_~start~0_150 v_~n~0_112) (<= 0 v_~start~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= (+ v_~start~0_150 1) v_~start~0_149) (= |v_thread2Thread1of1ForFork1_~cond~0#1_72| (ite (= (ite (or (< v_~start~0_149 v_~end~0_196) (< v_~i~0_191 v_~N~0_161)) 1 0) 0) 0 1)) (= (ite (= 0 (ite (and (not (= (mod v_~ok~0_97 256) 0)) (<= v_~new~0_64 v_~v_old~0_85)) 1 0)) 0 1) v_~ok~0_96) (= v_~new~0_64 (select (select |v_#memory_int_267| v_~queue~0.base_108) (+ (* v_~start~0_150 4) v_~queue~0.offset_108)))) InVars {~start~0=v_~start~0_150, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_97, ~i~0=v_~i~0_191, #memory_int=|v_#memory_int_267|, ~end~0=v_~end~0_196, ~N~0=v_~N~0_161, ~v_old~0=v_~v_old~0_85, ~queue~0.base=v_~queue~0.base_108, ~n~0=v_~n~0_112} OutVars{~start~0=v_~start~0_149, ~new~0=v_~new~0_64, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_96, ~i~0=v_~i~0_191, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_161, ~queue~0.base=v_~queue~0.base_108, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_72|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_267|, ~end~0=v_~end~0_196, ~v_old~0=v_~v_old~0_84, ~n~0=v_~n~0_112} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:08:58,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:08:58,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:08:58,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_20)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:08:58,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:08:58,612 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:08:58,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 755 [2022-12-13 02:08:58,613 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 272 transitions, 4056 flow [2022-12-13 02:08:58,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:58,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:58,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:58,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 02:08:58,613 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash -578039372, now seen corresponding path program 1 times [2022-12-13 02:08:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:58,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355366135] [2022-12-13 02:08:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:59,833 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:08:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:59,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355366135] [2022-12-13 02:08:59,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355366135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:59,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120750994] [2022-12-13 02:08:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:59,835 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:59,841 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:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:59,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 02:08:59,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:00,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:00,088 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 02:09:00,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 02:09:00,104 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 27 treesize of output 15 [2022-12-13 02:09:00,222 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 19 treesize of output 7 [2022-12-13 02:09:00,242 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:09:00,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:00,560 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-13 02:09:00,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 73 [2022-12-13 02:09:00,569 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 33 treesize of output 27 [2022-12-13 02:09:00,704 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:09:00,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120750994] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:00,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:00,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-13 02:09:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810743243] [2022-12-13 02:09:00,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:00,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 02:09:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 02:09:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-12-13 02:09:00,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 02:09:00,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 272 transitions, 4056 flow. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:00,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:00,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 02:09:00,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:02,622 INFO L130 PetriNetUnfolder]: 2812/5110 cut-off events. [2022-12-13 02:09:02,622 INFO L131 PetriNetUnfolder]: For 45013/45013 co-relation queries the response was YES. [2022-12-13 02:09:02,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32394 conditions, 5110 events. 2812/5110 cut-off events. For 45013/45013 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 33404 event pairs, 279 based on Foata normal form. 16/5114 useless extension candidates. Maximal degree in co-relation 30027. Up to 1729 conditions per place. [2022-12-13 02:09:02,649 INFO L137 encePairwiseOnDemand]: 9/45 looper letters, 275 selfloop transitions, 246 changer transitions 26/547 dead transitions. [2022-12-13 02:09:02,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 547 transitions, 8385 flow [2022-12-13 02:09:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 02:09:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 02:09:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2022-12-13 02:09:02,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2022-12-13 02:09:02,651 INFO L175 Difference]: Start difference. First operand has 114 places, 272 transitions, 4056 flow. Second operand 18 states and 189 transitions. [2022-12-13 02:09:02,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 547 transitions, 8385 flow [2022-12-13 02:09:02,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 547 transitions, 8299 flow, removed 43 selfloop flow, removed 0 redundant places. [2022-12-13 02:09:02,833 INFO L231 Difference]: Finished difference. Result has 143 places, 364 transitions, 6318 flow [2022-12-13 02:09:02,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3819, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6318, PETRI_PLACES=143, PETRI_TRANSITIONS=364} [2022-12-13 02:09:02,834 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 118 predicate places. [2022-12-13 02:09:02,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:02,834 INFO L89 Accepts]: Start accepts. Operand has 143 places, 364 transitions, 6318 flow [2022-12-13 02:09:02,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:02,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:02,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 364 transitions, 6318 flow [2022-12-13 02:09:02,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 364 transitions, 6318 flow [2022-12-13 02:09:03,036 INFO L130 PetriNetUnfolder]: 583/1670 cut-off events. [2022-12-13 02:09:03,036 INFO L131 PetriNetUnfolder]: For 19150/19210 co-relation queries the response was YES. [2022-12-13 02:09:03,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11182 conditions, 1670 events. 583/1670 cut-off events. For 19150/19210 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12963 event pairs, 11 based on Foata normal form. 12/1673 useless extension candidates. Maximal degree in co-relation 10839. Up to 522 conditions per place. [2022-12-13 02:09:03,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 364 transitions, 6318 flow [2022-12-13 02:09:03,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-13 02:09:03,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 02:09:04,070 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:09:04,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1237 [2022-12-13 02:09:04,071 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 363 transitions, 6338 flow [2022-12-13 02:09:04,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:04,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:04,071 INFO L214 CegarLoopForPetriNet]: trace histogram [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,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 02:09:04,276 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,SelfDestructingSolverStorable10 [2022-12-13 02:09:04,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash -110853110, now seen corresponding path program 1 times [2022-12-13 02:09:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888055970] [2022-12-13 02:09:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:05,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888055970] [2022-12-13 02:09:05,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888055970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:05,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007019551] [2022-12-13 02:09:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:05,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:05,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:05,079 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:09:05,081 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:09:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:05,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 02:09:05,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:05,406 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 02:09:05,407 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 42 treesize of output 10 [2022-12-13 02:09:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:09:05,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:07,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:07,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 126 [2022-12-13 02:09:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:09:07,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007019551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:07,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:07,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-13 02:09:07,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835686048] [2022-12-13 02:09:07,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:07,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 02:09:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 02:09:07,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-12-13 02:09:07,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 02:09:07,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 363 transitions, 6338 flow. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:07,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 02:09:07,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:09,864 INFO L130 PetriNetUnfolder]: 3730/6672 cut-off events. [2022-12-13 02:09:09,864 INFO L131 PetriNetUnfolder]: For 80421/80421 co-relation queries the response was YES. [2022-12-13 02:09:09,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47220 conditions, 6672 events. 3730/6672 cut-off events. For 80421/80421 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 44921 event pairs, 420 based on Foata normal form. 13/6673 useless extension candidates. Maximal degree in co-relation 44456. Up to 2192 conditions per place. [2022-12-13 02:09:09,925 INFO L137 encePairwiseOnDemand]: 12/49 looper letters, 320 selfloop transitions, 307 changer transitions 34/661 dead transitions. [2022-12-13 02:09:09,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 661 transitions, 11572 flow [2022-12-13 02:09:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 02:09:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 02:09:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 210 transitions. [2022-12-13 02:09:09,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22556390977443608 [2022-12-13 02:09:09,927 INFO L175 Difference]: Start difference. First operand has 142 places, 363 transitions, 6338 flow. Second operand 19 states and 210 transitions. [2022-12-13 02:09:09,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 661 transitions, 11572 flow [2022-12-13 02:09:10,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 661 transitions, 11374 flow, removed 99 selfloop flow, removed 0 redundant places. [2022-12-13 02:09:10,396 INFO L231 Difference]: Finished difference. Result has 172 places, 465 transitions, 9128 flow [2022-12-13 02:09:10,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6202, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9128, PETRI_PLACES=172, PETRI_TRANSITIONS=465} [2022-12-13 02:09:10,397 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 147 predicate places. [2022-12-13 02:09:10,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:10,397 INFO L89 Accepts]: Start accepts. Operand has 172 places, 465 transitions, 9128 flow [2022-12-13 02:09:10,399 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:10,399 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:10,399 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 465 transitions, 9128 flow [2022-12-13 02:09:10,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 465 transitions, 9128 flow [2022-12-13 02:09:10,659 INFO L130 PetriNetUnfolder]: 786/2198 cut-off events. [2022-12-13 02:09:10,660 INFO L131 PetriNetUnfolder]: For 34664/34719 co-relation queries the response was YES. [2022-12-13 02:09:10,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16355 conditions, 2198 events. 786/2198 cut-off events. For 34664/34719 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 18033 event pairs, 12 based on Foata normal form. 9/2202 useless extension candidates. Maximal degree in co-relation 16274. Up to 703 conditions per place. [2022-12-13 02:09:10,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 465 transitions, 9128 flow [2022-12-13 02:09:10,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 1892 [2022-12-13 02:09:22,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:09:22,498 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:09:22,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12101 [2022-12-13 02:09:22,499 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 464 transitions, 9168 flow [2022-12-13 02:09:22,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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:22,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:22,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:22,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 02:09:22,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:22,705 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 815641561, now seen corresponding path program 1 times [2022-12-13 02:09:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:22,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841701270] [2022-12-13 02:09:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:24,997 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:09:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:24,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841701270] [2022-12-13 02:09:24,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841701270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:24,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976165459] [2022-12-13 02:09:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:24,999 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:25,005 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:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:25,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 02:09:25,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:25,113 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 34 treesize of output 32 [2022-12-13 02:09:25,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 02:09:25,448 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 0 case distinctions, treesize of input 38 treesize of output 10 [2022-12-13 02:09:25,470 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:09:25,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:25,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:25,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 258 treesize of output 228 [2022-12-13 02:09:25,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:25,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-13 02:09:25,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:25,858 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 144 treesize of output 137 [2022-12-13 02:09:26,701 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:09:26,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976165459] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:26,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:26,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-13 02:09:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009161372] [2022-12-13 02:09:26,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:26,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 02:09:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 02:09:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=348, Unknown=1, NotChecked=0, Total=462 [2022-12-13 02:09:26,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 02:09:26,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 464 transitions, 9168 flow. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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:26,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:26,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 02:09:26,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:29,321 INFO L130 PetriNetUnfolder]: 4411/7834 cut-off events. [2022-12-13 02:09:29,322 INFO L131 PetriNetUnfolder]: For 127257/127257 co-relation queries the response was YES. [2022-12-13 02:09:29,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60745 conditions, 7834 events. 4411/7834 cut-off events. For 127257/127257 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 54920 event pairs, 800 based on Foata normal form. 29/7851 useless extension candidates. Maximal degree in co-relation 60650. Up to 3535 conditions per place. [2022-12-13 02:09:29,422 INFO L137 encePairwiseOnDemand]: 22/52 looper letters, 362 selfloop transitions, 280 changer transitions 25/667 dead transitions. [2022-12-13 02:09:29,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 667 transitions, 13733 flow [2022-12-13 02:09:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:09:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:09:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2022-12-13 02:09:29,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20562130177514792 [2022-12-13 02:09:29,424 INFO L175 Difference]: Start difference. First operand has 169 places, 464 transitions, 9168 flow. Second operand 13 states and 139 transitions. [2022-12-13 02:09:29,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 667 transitions, 13733 flow [2022-12-13 02:09:30,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 667 transitions, 13381 flow, removed 136 selfloop flow, removed 9 redundant places. [2022-12-13 02:09:30,052 INFO L231 Difference]: Finished difference. Result has 175 places, 541 transitions, 11543 flow [2022-12-13 02:09:30,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=8555, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11543, PETRI_PLACES=175, PETRI_TRANSITIONS=541} [2022-12-13 02:09:30,053 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 150 predicate places. [2022-12-13 02:09:30,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:30,053 INFO L89 Accepts]: Start accepts. Operand has 175 places, 541 transitions, 11543 flow [2022-12-13 02:09:30,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:30,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:30,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 541 transitions, 11543 flow [2022-12-13 02:09:30,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 541 transitions, 11543 flow [2022-12-13 02:09:30,419 INFO L130 PetriNetUnfolder]: 933/2593 cut-off events. [2022-12-13 02:09:30,419 INFO L131 PetriNetUnfolder]: For 41955/41998 co-relation queries the response was YES. [2022-12-13 02:09:30,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19865 conditions, 2593 events. 933/2593 cut-off events. For 41955/41998 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22368 event pairs, 9 based on Foata normal form. 7/2595 useless extension candidates. Maximal degree in co-relation 19769. Up to 889 conditions per place. [2022-12-13 02:09:30,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 541 transitions, 11543 flow [2022-12-13 02:09:30,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 2286 [2022-12-13 02:09:30,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:09:30,743 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:09:30,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 690 [2022-12-13 02:09:30,743 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 540 transitions, 11532 flow [2022-12-13 02:09:30,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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:30,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:30,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:30,748 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:30,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:30,949 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash 835940429, now seen corresponding path program 2 times [2022-12-13 02:09:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:30,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179234545] [2022-12-13 02:09:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:30,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:31,967 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:09:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:31,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179234545] [2022-12-13 02:09:31,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179234545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:31,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530758498] [2022-12-13 02:09:31,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:09:31,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:31,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:31,969 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:31,971 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:32,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:09:32,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:09:32,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:09:32,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:32,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:32,255 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 02:09:32,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 02:09:32,270 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 27 treesize of output 15 [2022-12-13 02:09:32,399 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 19 treesize of output 7 [2022-12-13 02:09:32,417 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:09:32,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:32,768 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-13 02:09:32,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 73 [2022-12-13 02:09:32,774 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 33 treesize of output 27 [2022-12-13 02:09:32,849 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:09:32,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530758498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:32,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:32,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:09:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95429832] [2022-12-13 02:09:32,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:32,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:09:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:32,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:09:32,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=253, Unknown=2, NotChecked=0, Total=342 [2022-12-13 02:09:32,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:09:32,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 540 transitions, 11532 flow. Second operand has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:32,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:32,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:09:32,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:36,014 INFO L130 PetriNetUnfolder]: 5280/9335 cut-off events. [2022-12-13 02:09:36,014 INFO L131 PetriNetUnfolder]: For 167002/167002 co-relation queries the response was YES. [2022-12-13 02:09:36,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75405 conditions, 9335 events. 5280/9335 cut-off events. For 167002/167002 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 67259 event pairs, 508 based on Foata normal form. 13/9336 useless extension candidates. Maximal degree in co-relation 75295. Up to 3494 conditions per place. [2022-12-13 02:09:36,096 INFO L137 encePairwiseOnDemand]: 14/47 looper letters, 294 selfloop transitions, 428 changer transitions 27/749 dead transitions. [2022-12-13 02:09:36,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 749 transitions, 16305 flow [2022-12-13 02:09:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:09:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:09:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2022-12-13 02:09:36,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24822695035460993 [2022-12-13 02:09:36,102 INFO L175 Difference]: Start difference. First operand has 173 places, 540 transitions, 11532 flow. Second operand 12 states and 140 transitions. [2022-12-13 02:09:36,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 749 transitions, 16305 flow [2022-12-13 02:09:36,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 749 transitions, 16206 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-12-13 02:09:36,954 INFO L231 Difference]: Finished difference. Result has 187 places, 613 transitions, 14602 flow [2022-12-13 02:09:36,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=11457, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14602, PETRI_PLACES=187, PETRI_TRANSITIONS=613} [2022-12-13 02:09:36,955 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 162 predicate places. [2022-12-13 02:09:36,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:36,955 INFO L89 Accepts]: Start accepts. Operand has 187 places, 613 transitions, 14602 flow [2022-12-13 02:09:36,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:36,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:36,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 613 transitions, 14602 flow [2022-12-13 02:09:36,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 613 transitions, 14602 flow [2022-12-13 02:09:37,491 INFO L130 PetriNetUnfolder]: 1122/3102 cut-off events. [2022-12-13 02:09:37,491 INFO L131 PetriNetUnfolder]: For 60412/60488 co-relation queries the response was YES. [2022-12-13 02:09:37,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25279 conditions, 3102 events. 1122/3102 cut-off events. For 60412/60488 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 27708 event pairs, 13 based on Foata normal form. 13/3109 useless extension candidates. Maximal degree in co-relation 25177. Up to 1071 conditions per place. [2022-12-13 02:09:37,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 613 transitions, 14602 flow [2022-12-13 02:09:37,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 2666 [2022-12-13 02:09:37,587 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:37,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 632 [2022-12-13 02:09:37,588 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 613 transitions, 14602 flow [2022-12-13 02:09:37,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:37,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:37,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:37,595 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:37,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 02:09:37,790 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash 918216271, now seen corresponding path program 1 times [2022-12-13 02:09:37,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:37,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652206965] [2022-12-13 02:09:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:37,841 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:09:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:37,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652206965] [2022-12-13 02:09:37,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652206965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:37,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861239944] [2022-12-13 02:09:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:37,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:37,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:37,844 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:37,846 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:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:37,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:09:37,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:37,987 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:09:37,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:38,013 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:09:38,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861239944] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:38,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:38,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 02:09:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598947549] [2022-12-13 02:09:38,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:38,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:09:38,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:38,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:09:38,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:09:38,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:09:38,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 613 transitions, 14602 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 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:09:38,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:38,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:09:38,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:40,456 INFO L130 PetriNetUnfolder]: 6162/10835 cut-off events. [2022-12-13 02:09:40,457 INFO L131 PetriNetUnfolder]: For 238275/238275 co-relation queries the response was YES. [2022-12-13 02:09:40,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94088 conditions, 10835 events. 6162/10835 cut-off events. For 238275/238275 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 80116 event pairs, 1465 based on Foata normal form. 131/10958 useless extension candidates. Maximal degree in co-relation 93972. Up to 4896 conditions per place. [2022-12-13 02:09:40,699 INFO L137 encePairwiseOnDemand]: 24/47 looper letters, 707 selfloop transitions, 177 changer transitions 1/885 dead transitions. [2022-12-13 02:09:40,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 885 transitions, 22425 flow [2022-12-13 02:09:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:09:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:09:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 02:09:40,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4085106382978723 [2022-12-13 02:09:40,701 INFO L175 Difference]: Start difference. First operand has 186 places, 613 transitions, 14602 flow. Second operand 5 states and 96 transitions. [2022-12-13 02:09:40,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 885 transitions, 22425 flow [2022-12-13 02:09:42,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 885 transitions, 21808 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-12-13 02:09:42,104 INFO L231 Difference]: Finished difference. Result has 188 places, 687 transitions, 16271 flow [2022-12-13 02:09:42,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14150, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16271, PETRI_PLACES=188, PETRI_TRANSITIONS=687} [2022-12-13 02:09:42,105 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 163 predicate places. [2022-12-13 02:09:42,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:42,105 INFO L89 Accepts]: Start accepts. Operand has 188 places, 687 transitions, 16271 flow [2022-12-13 02:09:42,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:42,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:42,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 687 transitions, 16271 flow [2022-12-13 02:09:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 687 transitions, 16271 flow [2022-12-13 02:09:42,759 INFO L130 PetriNetUnfolder]: 1353/3678 cut-off events. [2022-12-13 02:09:42,759 INFO L131 PetriNetUnfolder]: For 82472/82576 co-relation queries the response was YES. [2022-12-13 02:09:42,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32155 conditions, 3678 events. 1353/3678 cut-off events. For 82472/82576 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 33720 event pairs, 20 based on Foata normal form. 16/3687 useless extension candidates. Maximal degree in co-relation 30645. Up to 1324 conditions per place. [2022-12-13 02:09:42,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 687 transitions, 16271 flow [2022-12-13 02:09:42,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 2866 [2022-12-13 02:09:42,873 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:42,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 769 [2022-12-13 02:09:42,874 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 687 transitions, 16271 flow [2022-12-13 02:09:42,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 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:09:42,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:42,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:42,879 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:09:43,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 02:09:43,078 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 93467737, now seen corresponding path program 1 times [2022-12-13 02:09:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:43,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994626320] [2022-12-13 02:09:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:44,222 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:09:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:44,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994626320] [2022-12-13 02:09:44,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994626320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:44,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234799881] [2022-12-13 02:09:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:44,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:44,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:44,232 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:09:44,237 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:09:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:44,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 02:09:44,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:44,536 INFO L321 Elim1Store]: treesize reduction 90, result has 17.4 percent of original size [2022-12-13 02:09:44,536 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 4 case distinctions, treesize of input 280 treesize of output 316 [2022-12-13 02:09:44,549 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 264 treesize of output 262 [2022-12-13 02:09:44,562 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 262 treesize of output 258 [2022-12-13 02:09:44,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 254 [2022-12-13 02:09:44,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 248 treesize of output 248 [2022-12-13 02:09:44,644 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 242 treesize of output 240 [2022-12-13 02:09:44,785 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 02:09:44,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-12-13 02:09:44,804 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:44,805 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2022-12-13 02:09:44,869 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 02:09:45,296 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-12-13 02:09:45,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 132 [2022-12-13 02:09:45,694 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 02:09:45,694 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 34 treesize of output 10 [2022-12-13 02:09:45,720 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:09:45,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:46,185 INFO L321 Elim1Store]: treesize reduction 98, result has 26.3 percent of original size [2022-12-13 02:09:46,185 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 326 treesize of output 369 [2022-12-13 02:09:46,199 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 310 treesize of output 308 [2022-12-13 02:09:46,208 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 308 treesize of output 304 [2022-12-13 02:09:46,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:46,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 304 treesize of output 301 [2022-12-13 02:09:46,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:46,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 294 treesize of output 295 [2022-12-13 02:09:46,263 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 288 treesize of output 286 [2022-12-13 02:09:46,440 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 02:09:46,469 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2022-12-13 02:09:46,469 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 4 case distinctions, treesize of input 199 treesize of output 184 [2022-12-13 02:09:46,474 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 160 treesize of output 154 [2022-12-13 02:09:46,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:46,484 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 193 treesize of output 185 [2022-12-13 02:09:46,489 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 163 treesize of output 157 [2022-12-13 02:09:46,571 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-13 02:09:46,571 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 14 treesize of output 4 [2022-12-13 02:09:46,586 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-12-13 02:09:46,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 26 [2022-12-13 02:09:46,594 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-13 02:09:46,595 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 14 treesize of output 4 [2022-12-13 02:09:46,615 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 02:09:46,619 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 02:09:46,625 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 02:09:46,625 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 30 treesize of output 1 [2022-12-13 02:09:46,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:46,634 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 106 treesize of output 95 [2022-12-13 02:09:46,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:46,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 103 [2022-12-13 02:09:46,687 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-13 02:09:46,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 02:09:46,713 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:09:46,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234799881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:46,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:46,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-13 02:09:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690614307] [2022-12-13 02:09:46,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:46,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 02:09:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:46,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 02:09:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=431, Unknown=2, NotChecked=0, Total=552 [2022-12-13 02:09:46,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:09:46,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 687 transitions, 16271 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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:46,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:46,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:09:46,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:07,698 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 48 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:10:10,307 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:10:17,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:10:23,539 INFO L130 PetriNetUnfolder]: 10918/19157 cut-off events. [2022-12-13 02:10:23,539 INFO L131 PetriNetUnfolder]: For 428389/428389 co-relation queries the response was YES. [2022-12-13 02:10:23,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168101 conditions, 19157 events. 10918/19157 cut-off events. For 428389/428389 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 154663 event pairs, 393 based on Foata normal form. 26/19160 useless extension candidates. Maximal degree in co-relation 159369. Up to 6699 conditions per place. [2022-12-13 02:10:23,845 INFO L137 encePairwiseOnDemand]: 4/47 looper letters, 684 selfloop transitions, 1144 changer transitions 169/1997 dead transitions. [2022-12-13 02:10:23,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1997 transitions, 46375 flow [2022-12-13 02:10:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-13 02:10:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-13 02:10:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 439 transitions. [2022-12-13 02:10:23,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16679331306990883 [2022-12-13 02:10:23,854 INFO L175 Difference]: Start difference. First operand has 188 places, 687 transitions, 16271 flow. Second operand 56 states and 439 transitions. [2022-12-13 02:10:23,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1997 transitions, 46375 flow [2022-12-13 02:10:27,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 1997 transitions, 46185 flow, removed 95 selfloop flow, removed 0 redundant places. [2022-12-13 02:10:27,679 INFO L231 Difference]: Finished difference. Result has 276 places, 1523 transitions, 39212 flow [2022-12-13 02:10:27,681 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=16197, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=445, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=39212, PETRI_PLACES=276, PETRI_TRANSITIONS=1523} [2022-12-13 02:10:27,681 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 251 predicate places. [2022-12-13 02:10:27,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:27,682 INFO L89 Accepts]: Start accepts. Operand has 276 places, 1523 transitions, 39212 flow [2022-12-13 02:10:27,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:27,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:27,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 1523 transitions, 39212 flow [2022-12-13 02:10:27,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 1523 transitions, 39212 flow [2022-12-13 02:10:30,800 INFO L130 PetriNetUnfolder]: 5315/11790 cut-off events. [2022-12-13 02:10:30,800 INFO L131 PetriNetUnfolder]: For 363707/364432 co-relation queries the response was YES. [2022-12-13 02:10:30,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121324 conditions, 11790 events. 5315/11790 cut-off events. For 363707/364432 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 116329 event pairs, 663 based on Foata normal form. 126/11589 useless extension candidates. Maximal degree in co-relation 119891. Up to 4272 conditions per place. [2022-12-13 02:10:31,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 1523 transitions, 39212 flow [2022-12-13 02:10:31,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 4416 [2022-12-13 02:10:31,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:10:45,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_20)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:10:45,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:10:48,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:48,458 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:48,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:48,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:48,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:49,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:49,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:49,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:10:49,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_20)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:10:49,479 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:10:57,068 INFO L241 LiptonReduction]: Total number of compositions: 10 [2022-12-13 02:10:57,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29387 [2022-12-13 02:10:57,069 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 1519 transitions, 39434 flow [2022-12-13 02:10:57,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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:10:57,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:57,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:57,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 02:10:57,269 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,SelfDestructingSolverStorable15 [2022-12-13 02:10:57,270 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:10:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 397507361, now seen corresponding path program 1 times [2022-12-13 02:10:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624539488] [2022-12-13 02:10:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:59,343 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:10:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:59,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624539488] [2022-12-13 02:10:59,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624539488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:10:59,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211254844] [2022-12-13 02:10:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:59,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:10:59,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:10:59,345 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:10:59,346 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:10:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:59,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:10:59,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:10:59,533 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 5 treesize of output 3 [2022-12-13 02:10:59,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:10:59,564 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 02:10:59,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-12-13 02:10:59,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 102 treesize of output 98 [2022-12-13 02:10:59,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:10:59,617 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 02:10:59,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-12-13 02:10:59,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 102 treesize of output 98 [2022-12-13 02:10:59,642 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 5 treesize of output 3 [2022-12-13 02:10:59,813 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 02:10:59,814 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 82 treesize of output 82 [2022-12-13 02:11:00,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2022-12-13 02:11:00,226 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:11:00,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:11:00,581 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:11:00,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211254844] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:11:00,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:11:00,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-13 02:11:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738860971] [2022-12-13 02:11:00,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:11:00,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 02:11:00,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:00,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 02:11:00,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=369, Unknown=2, NotChecked=0, Total=462 [2022-12-13 02:11:00,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-13 02:11:00,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 1519 transitions, 39434 flow. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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:11:00,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:00,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-13 02:11:00,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:06,658 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:11:17,824 INFO L130 PetriNetUnfolder]: 13338/23541 cut-off events. [2022-12-13 02:11:17,824 INFO L131 PetriNetUnfolder]: For 714494/714494 co-relation queries the response was YES. [2022-12-13 02:11:18,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253911 conditions, 23541 events. 13338/23541 cut-off events. For 714494/714494 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 198107 event pairs, 828 based on Foata normal form. 26/23529 useless extension candidates. Maximal degree in co-relation 250701. Up to 8041 conditions per place. [2022-12-13 02:11:18,387 INFO L137 encePairwiseOnDemand]: 13/71 looper letters, 594 selfloop transitions, 1585 changer transitions 71/2250 dead transitions. [2022-12-13 02:11:18,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 2250 transitions, 60204 flow [2022-12-13 02:11:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 02:11:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 02:11:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 258 transitions. [2022-12-13 02:11:18,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1253035454103934 [2022-12-13 02:11:18,390 INFO L175 Difference]: Start difference. First operand has 271 places, 1519 transitions, 39434 flow. Second operand 29 states and 258 transitions. [2022-12-13 02:11:18,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 2250 transitions, 60204 flow [2022-12-13 02:11:26,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 2250 transitions, 58238 flow, removed 920 selfloop flow, removed 5 redundant places. [2022-12-13 02:11:26,994 INFO L231 Difference]: Finished difference. Result has 305 places, 2037 transitions, 56601 flow [2022-12-13 02:11:26,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=37285, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1081, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=56601, PETRI_PLACES=305, PETRI_TRANSITIONS=2037} [2022-12-13 02:11:26,996 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 280 predicate places. [2022-12-13 02:11:26,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:26,996 INFO L89 Accepts]: Start accepts. Operand has 305 places, 2037 transitions, 56601 flow [2022-12-13 02:11:27,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:27,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:27,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 2037 transitions, 56601 flow [2022-12-13 02:11:27,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 2037 transitions, 56601 flow [2022-12-13 02:11:31,704 INFO L130 PetriNetUnfolder]: 6992/15455 cut-off events. [2022-12-13 02:11:31,704 INFO L131 PetriNetUnfolder]: For 528156/529077 co-relation queries the response was YES. [2022-12-13 02:11:31,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171056 conditions, 15455 events. 6992/15455 cut-off events. For 528156/529077 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 158480 event pairs, 849 based on Foata normal form. 156/15141 useless extension candidates. Maximal degree in co-relation 170918. Up to 5696 conditions per place. [2022-12-13 02:11:32,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 2037 transitions, 56601 flow [2022-12-13 02:11:32,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 5776 [2022-12-13 02:11:53,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:11:53,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:11:53,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:11:54,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:11:54,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] L59-->L54: Formula: (let ((.cse0 (select (select |v_#memory_int_540| v_~A~0.base_249) (+ (* v_~i~0_339 4) v_~A~0.offset_251)))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (< v_~i~0_339 v_~N~0_246) (<= .cse0 v_~last~0_198) (not (= 0 (ite (and (<= 0 v_~end~0_299) (< v_~end~0_299 v_~n~0_179)) 1 0))) (= (ite (= (select (select |v_#memory_int_540| v_~queue~0.base_211) (+ v_~queue~0.offset_211 (* v_~end~0_299 4))) .cse0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (= v_~end~0_298 (+ v_~end~0_299 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|))) InVars {~A~0.base=v_~A~0.base_249, ~queue~0.offset=v_~queue~0.offset_211, ~A~0.offset=v_~A~0.offset_251, ~i~0=v_~i~0_339, #memory_int=|v_#memory_int_540|, ~end~0=v_~end~0_299, ~N~0=v_~N~0_246, ~queue~0.base=v_~queue~0.base_211, ~n~0=v_~n~0_179, ~last~0=v_~last~0_198} OutVars{~A~0.base=v_~A~0.base_249, ~queue~0.offset=v_~queue~0.offset_211, ~i~0=v_~i~0_339, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_71|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_71|, ~N~0=v_~N~0_246, ~queue~0.base=v_~queue~0.base_211, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, ~A~0.offset=v_~A~0.offset_251, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, #memory_int=|v_#memory_int_540|, ~end~0=v_~end~0_298, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_71|, ~n~0=v_~n~0_179, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_94|, ~last~0=v_~last~0_198} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:12:05,256 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 02:12:05,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38260 [2022-12-13 02:12:05,257 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 2036 transitions, 56825 flow [2022-12-13 02:12:05,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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:05,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:05,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:05,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 02:12:05,457 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,SelfDestructingSolverStorable16 [2022-12-13 02:12:05,457 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:12:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash 417806229, now seen corresponding path program 2 times [2022-12-13 02:12:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:05,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407374248] [2022-12-13 02:12:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:07,776 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:12:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:07,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407374248] [2022-12-13 02:12:07,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407374248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:12:07,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160091071] [2022-12-13 02:12:07,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:12:07,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:12:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:12:07,777 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:12:07,779 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:12:07,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:12:07,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:12:07,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:12:07,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:12:08,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:12:08,050 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2022-12-13 02:12:08,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 698 treesize of output 701 [2022-12-13 02:12:08,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:12:08,114 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2022-12-13 02:12:08,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 666 treesize of output 677 [2022-12-13 02:12:08,198 INFO L321 Elim1Store]: treesize reduction 174, result has 19.8 percent of original size [2022-12-13 02:12:08,199 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 782 treesize of output 844 [2022-12-13 02:12:08,222 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 758 treesize of output 752 [2022-12-13 02:12:08,233 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 752 treesize of output 748 [2022-12-13 02:12:08,244 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 748 treesize of output 740 [2022-12-13 02:12:08,260 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 740 treesize of output 736 [2022-12-13 02:12:08,264 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 02:12:08,275 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 736 treesize of output 734 [2022-12-13 02:12:08,509 INFO L321 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-12-13 02:12:08,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 1 [2022-12-13 02:12:08,530 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:12:08,530 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2022-12-13 02:12:09,038 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-12-13 02:12:09,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 170 [2022-12-13 02:12:09,434 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 02:12:09,434 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 34 treesize of output 10 [2022-12-13 02:12:09,461 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:12:09,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:12:09,714 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:12:09,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160091071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:12:09,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:12:09,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-13 02:12:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573757651] [2022-12-13 02:12:09,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:12:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 02:12:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 02:12:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-12-13 02:12:09,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 02:12:09,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 2036 transitions, 56825 flow. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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:09,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:09,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 02:12:09,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:21,338 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:42,785 INFO L130 PetriNetUnfolder]: 19915/34940 cut-off events. [2022-12-13 02:12:42,785 INFO L131 PetriNetUnfolder]: For 1226444/1226444 co-relation queries the response was YES. [2022-12-13 02:12:43,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403380 conditions, 34940 events. 19915/34940 cut-off events. For 1226444/1226444 co-relation queries the response was YES. Maximal size of possible extension queue 1854. Compared 309877 event pairs, 2498 based on Foata normal form. 13/34801 useless extension candidates. Maximal degree in co-relation 403207. Up to 11767 conditions per place. [2022-12-13 02:12:43,626 INFO L137 encePairwiseOnDemand]: 7/78 looper letters, 947 selfloop transitions, 2689 changer transitions 121/3757 dead transitions. [2022-12-13 02:12:43,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 3757 transitions, 107365 flow [2022-12-13 02:12:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 02:12:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-13 02:12:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 419 transitions. [2022-12-13 02:12:43,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1310193871169481 [2022-12-13 02:12:43,632 INFO L175 Difference]: Start difference. First operand has 297 places, 2036 transitions, 56825 flow. Second operand 41 states and 419 transitions. [2022-12-13 02:12:43,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 3757 transitions, 107365 flow [2022-12-13 02:13:11,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 3757 transitions, 104273 flow, removed 1539 selfloop flow, removed 5 redundant places. [2022-12-13 02:13:11,346 INFO L231 Difference]: Finished difference. Result has 354 places, 3258 transitions, 98958 flow [2022-12-13 02:13:11,348 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=54954, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1545, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=98958, PETRI_PLACES=354, PETRI_TRANSITIONS=3258} [2022-12-13 02:13:11,348 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 329 predicate places. [2022-12-13 02:13:11,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:13:11,348 INFO L89 Accepts]: Start accepts. Operand has 354 places, 3258 transitions, 98958 flow [2022-12-13 02:13:11,362 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:13:11,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:13:11,363 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 3258 transitions, 98958 flow [2022-12-13 02:13:11,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 3258 transitions, 98958 flow [2022-12-13 02:13:20,320 INFO L130 PetriNetUnfolder]: 8878/19894 cut-off events. [2022-12-13 02:13:20,320 INFO L131 PetriNetUnfolder]: For 701585/703224 co-relation queries the response was YES. [2022-12-13 02:13:20,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223843 conditions, 19894 events. 8878/19894 cut-off events. For 701585/703224 co-relation queries the response was YES. Maximal size of possible extension queue 1565. Compared 217376 event pairs, 1296 based on Foata normal form. 224/19027 useless extension candidates. Maximal degree in co-relation 223680. Up to 6093 conditions per place. [2022-12-13 02:13:20,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 346 places, 3258 transitions, 98958 flow [2022-12-13 02:13:20,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 9054 [2022-12-13 02:13:25,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< v_~i~0_In_1 v_~N~0_In_1))) InVars {~i~0=v_~i~0_In_1, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:13:31,320 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:13:31,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19975 [2022-12-13 02:13:31,323 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 3258 transitions, 99019 flow [2022-12-13 02:13:31,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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:31,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:13:31,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:13:31,358 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:13:31,544 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,SelfDestructingSolverStorable17 [2022-12-13 02:13:31,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:13:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:13:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -599032011, now seen corresponding path program 1 times [2022-12-13 02:13:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:13:31,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011738632] [2022-12-13 02:13:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:13:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:33,050 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:13:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:13:33,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011738632] [2022-12-13 02:13:33,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011738632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:13:33,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591225298] [2022-12-13 02:13:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:33,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:13:33,052 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:13:33,054 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:13:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:33,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 02:13:33,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:13:33,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:13:33,319 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2022-12-13 02:13:33,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1970 treesize of output 1949 [2022-12-13 02:13:33,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:13:33,431 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2022-12-13 02:13:33,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1914 treesize of output 1925 [2022-12-13 02:13:33,510 INFO L321 Elim1Store]: treesize reduction 174, result has 19.8 percent of original size [2022-12-13 02:13:33,511 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 1968 treesize of output 2032 [2022-12-13 02:13:33,538 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 1946 treesize of output 1944 [2022-12-13 02:13:33,559 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 1944 treesize of output 1940 [2022-12-13 02:13:33,584 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 1940 treesize of output 1936 [2022-12-13 02:13:33,659 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 1936 treesize of output 1932 [2022-12-13 02:13:33,668 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 02:13:33,706 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 1932 treesize of output 1930 [2022-12-13 02:13:34,025 INFO L321 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-12-13 02:13:34,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 1 [2022-12-13 02:13:34,058 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:13:34,059 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2022-12-13 02:13:34,501 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-12-13 02:13:34,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 178 [2022-12-13 02:13:34,882 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 02:13:34,883 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 34 treesize of output 10 [2022-12-13 02:13:34,904 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:13:34,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:13:35,121 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:13:35,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591225298] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:13:35,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:13:35,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 02:13:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966494270] [2022-12-13 02:13:35,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:13:35,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 02:13:35,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:13:35,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 02:13:35,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-12-13 02:13:35,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 02:13:35,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 3258 transitions, 99019 flow. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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:35,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:13:35,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 02:13:35,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:14:11,302 INFO L130 PetriNetUnfolder]: 21230/37248 cut-off events. [2022-12-13 02:14:11,303 INFO L131 PetriNetUnfolder]: For 1427607/1427607 co-relation queries the response was YES. [2022-12-13 02:14:12,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449364 conditions, 37248 events. 21230/37248 cut-off events. For 1427607/1427607 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 332563 event pairs, 2889 based on Foata normal form. 7/37007 useless extension candidates. Maximal degree in co-relation 449187. Up to 11478 conditions per place. [2022-12-13 02:14:12,385 INFO L137 encePairwiseOnDemand]: 8/76 looper letters, 848 selfloop transitions, 2997 changer transitions 86/3931 dead transitions. [2022-12-13 02:14:12,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 3931 transitions, 123689 flow [2022-12-13 02:14:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 02:14:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 02:14:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 322 transitions. [2022-12-13 02:14:12,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12105263157894737 [2022-12-13 02:14:12,386 INFO L175 Difference]: Start difference. First operand has 346 places, 3258 transitions, 99019 flow. Second operand 35 states and 322 transitions. [2022-12-13 02:14:12,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 3931 transitions, 123689 flow [2022-12-13 02:14:47,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 3931 transitions, 120812 flow, removed 727 selfloop flow, removed 9 redundant places. [2022-12-13 02:14:47,826 INFO L231 Difference]: Finished difference. Result has 391 places, 3707 transitions, 120241 flow [2022-12-13 02:14:47,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=96667, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=120241, PETRI_PLACES=391, PETRI_TRANSITIONS=3707} [2022-12-13 02:14:47,828 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 366 predicate places. [2022-12-13 02:14:47,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:14:47,829 INFO L89 Accepts]: Start accepts. Operand has 391 places, 3707 transitions, 120241 flow [2022-12-13 02:14:47,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:14:47,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:14:47,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 391 places, 3707 transitions, 120241 flow [2022-12-13 02:14:47,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 383 places, 3707 transitions, 120241 flow [2022-12-13 02:14:59,013 INFO L130 PetriNetUnfolder]: 9689/21625 cut-off events. [2022-12-13 02:14:59,013 INFO L131 PetriNetUnfolder]: For 891603/893075 co-relation queries the response was YES. [2022-12-13 02:14:59,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262667 conditions, 21625 events. 9689/21625 cut-off events. For 891603/893075 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 237586 event pairs, 1397 based on Foata normal form. 213/20729 useless extension candidates. Maximal degree in co-relation 262450. Up to 6590 conditions per place. [2022-12-13 02:14:59,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 383 places, 3707 transitions, 120241 flow [2022-12-13 02:14:59,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 10060 [2022-12-13 02:15:00,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:15:00,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:15:00,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:15:00,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 02:15:00,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] L59-->L55-1: Formula: (let ((.cse0 (select (select |v_#memory_int_641| v_~A~0.base_295) (+ (* v_~i~0_400 4) v_~A~0.offset_297)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| 0)) (= v_~end~0_359 (+ v_~end~0_360 1)) (not (= (ite (and (< v_~end~0_360 v_~n~0_225) (<= 0 v_~end~0_360)) 1 0) 0)) (< v_~i~0_400 v_~N~0_300) (= (ite (= .cse0 (select (select |v_#memory_int_641| v_~queue~0.base_259) (+ (* v_~end~0_360 4) v_~queue~0.offset_259))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|) (<= .cse0 v_~last~0_238) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_124| .cse0) (= v_~last~0_237 |v_thread1Thread1of1ForFork0_#t~mem5#1_124|))) InVars {~A~0.base=v_~A~0.base_295, ~queue~0.offset=v_~queue~0.offset_259, ~A~0.offset=v_~A~0.offset_297, ~i~0=v_~i~0_400, #memory_int=|v_#memory_int_641|, ~end~0=v_~end~0_360, ~N~0=v_~N~0_300, ~queue~0.base=v_~queue~0.base_259, ~n~0=v_~n~0_225, ~last~0=v_~last~0_238} OutVars{~A~0.base=v_~A~0.base_295, ~queue~0.offset=v_~queue~0.offset_259, ~i~0=v_~i~0_400, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_87|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_87|, ~N~0=v_~N~0_300, ~queue~0.base=v_~queue~0.base_259, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_124|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|, ~A~0.offset=v_~A~0.offset_297, #memory_int=|v_#memory_int_641|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|, ~end~0=v_~end~0_359, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_87|, ~n~0=v_~n~0_225, ~last~0=v_~last~0_237, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_114|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, ~last~0, thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:15:01,013 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:15:01,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13185 [2022-12-13 02:15:01,013 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 3706 transitions, 120272 flow [2022-12-13 02:15:01,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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:01,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:01,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:01,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 02:15:01,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:15:01,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:15:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1373642387, now seen corresponding path program 1 times [2022-12-13 02:15:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:01,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16804040] [2022-12-13 02:15:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:02,028 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:15:02,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:02,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16804040] [2022-12-13 02:15:02,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16804040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:15:02,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165705752] [2022-12-13 02:15:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:02,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:15:02,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:15:02,030 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:15:02,032 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:15:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:02,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:15:02,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:15:02,299 INFO L321 Elim1Store]: treesize reduction 90, result has 17.4 percent of original size [2022-12-13 02:15:02,299 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 4 case distinctions, treesize of input 280 treesize of output 316 [2022-12-13 02:15:02,309 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 264 treesize of output 262 [2022-12-13 02:15:02,316 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 262 treesize of output 258 [2022-12-13 02:15:02,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 254 [2022-12-13 02:15:02,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 248 treesize of output 248 [2022-12-13 02:15:02,342 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 242 treesize of output 240 [2022-12-13 02:15:02,438 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 02:15:02,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-12-13 02:15:02,450 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:15:02,451 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2022-12-13 02:15:02,503 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 02:15:02,815 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-12-13 02:15:02,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 132 [2022-12-13 02:15:03,105 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 02:15:03,105 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 34 treesize of output 10 [2022-12-13 02:15:03,121 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:15:03,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:15:03,211 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_1527 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1527) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)))) is different from false [2022-12-13 02:15:03,473 INFO L321 Elim1Store]: treesize reduction 98, result has 26.3 percent of original size [2022-12-13 02:15:03,473 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 326 treesize of output 369 [2022-12-13 02:15:03,488 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 310 treesize of output 308 [2022-12-13 02:15:03,498 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 308 treesize of output 304 [2022-12-13 02:15:03,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:15:03,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 304 treesize of output 301 [2022-12-13 02:15:03,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:15:03,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 294 treesize of output 295 [2022-12-13 02:15:03,561 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 288 treesize of output 286 [2022-12-13 02:15:03,879 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 02:15:03,882 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:15:03,883 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 254 [2022-12-13 02:15:03,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:15:03,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 19119 treesize of output 18907 [2022-12-13 02:15:04,039 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 18801 treesize of output 17265 [2022-12-13 02:15:04,104 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 17265 treesize of output 17259 Received shutdown request... [2022-12-13 02:21:19,312 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 02:21:19,314 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:21:19,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 02:21:19,323 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:21:19,354 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:21:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:21:19,519 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 5ms.. [2022-12-13 02:21:19,520 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:21:19,520 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:21:19,521 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:19,523 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:21:19,523 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:21:19,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:21:19 BasicIcfg [2022-12-13 02:21:19,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:21:19,525 INFO L158 Benchmark]: Toolchain (without parser) took 841067.34ms. Allocated memory was 182.5MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 158.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 02:21:19,525 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:21:19,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.24ms. Allocated memory is still 182.5MB. Free memory was 158.8MB in the beginning and 145.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 02:21:19,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.34ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 143.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:21:19,525 INFO L158 Benchmark]: Boogie Preprocessor took 35.59ms. Allocated memory is still 182.5MB. Free memory was 143.6MB in the beginning and 141.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:21:19,525 INFO L158 Benchmark]: RCFGBuilder took 657.16ms. Allocated memory is still 182.5MB. Free memory was 141.7MB in the beginning and 157.9MB in the end (delta: -16.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 02:21:19,526 INFO L158 Benchmark]: TraceAbstraction took 840072.81ms. Allocated memory was 182.5MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 156.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 02:21:19,526 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.24ms. Allocated memory is still 182.5MB. Free memory was 158.8MB in the beginning and 145.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.34ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 143.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.59ms. Allocated memory is still 182.5MB. Free memory was 143.6MB in the beginning and 141.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 657.16ms. Allocated memory is still 182.5MB. Free memory was 141.7MB in the beginning and 157.9MB in the end (delta: -16.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 840072.81ms. Allocated memory was 182.5MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 156.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 155 PlacesBefore, 25 PlacesAfterwards, 163 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 110 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 423, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 423, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 423, unknown conditional: 0, unknown unconditional: 423] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 623, Positive conditional cache size: 0, Positive unconditional cache size: 623, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 21, unknown conditional: 2, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 26 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 11, Negative conditional cache size: 4, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 12, independent conditional: 7, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 13, Negative conditional cache size: 4, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 38 PlacesBefore, 37 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.5s, 100 PlacesBefore, 97 PlacesAfterwards, 182 TransitionsBefore, 179 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 669, independent: 587, independent conditional: 587, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 669, independent: 587, independent conditional: 505, independent unconditional: 82, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 670, independent: 587, independent conditional: 505, independent unconditional: 82, dependent: 83, dependent conditional: 83, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 670, independent: 587, independent conditional: 505, independent unconditional: 82, dependent: 83, dependent conditional: 83, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 670, independent: 582, independent conditional: 500, independent unconditional: 82, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 27, Positive conditional cache size: 7, Positive unconditional cache size: 20, Negative cache size: 18, Negative conditional cache size: 7, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 97 PlacesBefore, 98 PlacesAfterwards, 217 TransitionsBefore, 218 TransitionsAfterwards, 830 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 180, independent: 94, independent conditional: 92, independent unconditional: 2, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 94, independent conditional: 92, independent unconditional: 2, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 94, independent conditional: 92, independent unconditional: 2, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 93, independent conditional: 92, independent unconditional: 1, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 29, Positive conditional cache size: 7, Positive unconditional cache size: 22, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 117 PlacesBefore, 116 PlacesAfterwards, 310 TransitionsBefore, 309 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 110, dependent conditional: 110, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 34, Positive conditional cache size: 8, Positive unconditional cache size: 26, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 115 PlacesBefore, 114 PlacesAfterwards, 273 TransitionsBefore, 272 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1298, independent: 1170, independent conditional: 1170, independent unconditional: 0, dependent: 128, dependent conditional: 128, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1298, independent: 1170, independent conditional: 1034, independent unconditional: 136, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1298, independent: 1170, independent conditional: 1034, independent unconditional: 136, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1298, independent: 1170, independent conditional: 1034, independent unconditional: 136, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1298, independent: 1161, independent conditional: 1030, independent unconditional: 131, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 43, Positive conditional cache size: 12, Positive unconditional cache size: 31, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 143 PlacesBefore, 142 PlacesAfterwards, 364 TransitionsBefore, 363 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2494, independent: 2328, independent conditional: 2328, independent unconditional: 0, dependent: 166, dependent conditional: 166, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2494, independent: 2328, independent conditional: 2162, independent unconditional: 166, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2494, independent: 2328, independent conditional: 2162, independent unconditional: 166, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2494, independent: 2328, independent conditional: 2162, independent unconditional: 166, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2494, independent: 2328, independent conditional: 2162, independent unconditional: 166, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 48, Positive conditional cache size: 13, Positive unconditional cache size: 35, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 170 PlacesBefore, 169 PlacesAfterwards, 465 TransitionsBefore, 464 TransitionsAfterwards, 1892 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2746, independent: 2550, independent conditional: 2550, independent unconditional: 0, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2746, independent: 2550, independent conditional: 2158, independent unconditional: 392, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3138, independent: 2550, independent conditional: 2158, independent unconditional: 392, dependent: 588, dependent conditional: 588, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3138, independent: 2550, independent conditional: 2158, independent unconditional: 392, dependent: 588, dependent conditional: 588, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3138, independent: 2546, independent conditional: 2154, independent unconditional: 392, dependent: 584, dependent conditional: 584, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 52, Positive conditional cache size: 17, Positive unconditional cache size: 35, Negative cache size: 24, Negative conditional cache size: 13, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 173 PlacesBefore, 173 PlacesAfterwards, 541 TransitionsBefore, 540 TransitionsAfterwards, 2286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3422, independent: 3194, independent conditional: 3194, independent unconditional: 0, dependent: 228, dependent conditional: 228, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3422, independent: 3194, independent conditional: 2966, independent unconditional: 228, dependent: 228, dependent conditional: 228, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3650, independent: 3194, independent conditional: 2966, independent unconditional: 228, dependent: 456, dependent conditional: 456, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3650, independent: 3194, independent conditional: 2966, independent unconditional: 228, dependent: 456, dependent conditional: 456, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3650, independent: 3193, independent conditional: 2965, independent unconditional: 228, dependent: 454, dependent conditional: 454, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 53, Positive conditional cache size: 18, Positive unconditional cache size: 35, Negative cache size: 26, Negative conditional cache size: 15, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 186 PlacesBefore, 186 PlacesAfterwards, 613 TransitionsBefore, 613 TransitionsAfterwards, 2666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3294, independent: 3172, independent conditional: 3172, independent unconditional: 0, dependent: 122, dependent conditional: 122, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3294, independent: 3172, independent conditional: 2928, independent unconditional: 244, dependent: 122, dependent conditional: 122, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3538, independent: 3172, independent conditional: 2928, independent unconditional: 244, dependent: 366, dependent conditional: 366, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3538, independent: 3172, independent conditional: 2928, independent unconditional: 244, dependent: 366, dependent conditional: 366, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3538, independent: 3172, independent conditional: 2928, independent unconditional: 244, dependent: 364, dependent conditional: 364, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 53, Positive conditional cache size: 18, Positive unconditional cache size: 35, Negative cache size: 28, Negative conditional cache size: 17, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 188 PlacesBefore, 188 PlacesAfterwards, 687 TransitionsBefore, 687 TransitionsAfterwards, 2866 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3952, independent: 3800, independent conditional: 3800, independent unconditional: 0, dependent: 152, dependent conditional: 152, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3952, independent: 3800, independent conditional: 3496, independent unconditional: 304, dependent: 152, dependent conditional: 152, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4256, independent: 3800, independent conditional: 3496, independent unconditional: 304, dependent: 456, dependent conditional: 456, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4256, independent: 3800, independent conditional: 3496, independent unconditional: 304, dependent: 456, dependent conditional: 456, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4256, independent: 3800, independent conditional: 3496, independent unconditional: 304, dependent: 456, dependent conditional: 456, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 53, Positive conditional cache size: 18, Positive unconditional cache size: 35, Negative cache size: 28, Negative conditional cache size: 17, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.0s, 276 PlacesBefore, 271 PlacesAfterwards, 1523 TransitionsBefore, 1519 TransitionsAfterwards, 4416 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 63, Positive conditional cache size: 28, Positive unconditional cache size: 35, Negative cache size: 28, Negative conditional cache size: 17, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.2s, 299 PlacesBefore, 297 PlacesAfterwards, 2037 TransitionsBefore, 2036 TransitionsAfterwards, 5776 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 66, Positive conditional cache size: 31, Positive unconditional cache size: 35, Negative cache size: 28, Negative conditional cache size: 17, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4s, 346 PlacesBefore, 346 PlacesAfterwards, 3258 TransitionsBefore, 3258 TransitionsAfterwards, 9054 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 66, Positive conditional cache size: 31, Positive unconditional cache size: 35, Negative cache size: 28, Negative conditional cache size: 17, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 383 PlacesBefore, 382 PlacesAfterwards, 3707 TransitionsBefore, 3706 TransitionsAfterwards, 10060 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 66, Positive conditional cache size: 31, Positive unconditional cache size: 35, Negative cache size: 28, Negative conditional cache size: 17, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 5ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 5ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 183 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 840.0s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 286.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 212 mSolverCounterUnknown, 3941 SdHoareTripleChecker+Valid, 22.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3941 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 20.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9785 IncrementalHoareTripleChecker+Invalid, 11381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1384 mSolverCounterUnsat, 1 mSDtfsCounter, 9785 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 292 SyntacticMatches, 6 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4461 ImplicationChecksByTransitivity, 114.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120272occurred in iteration=19, InterpolantAutomatonStates: 319, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 551 NumberOfCodeBlocks, 551 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 716 ConstructedInterpolants, 89 QuantifiedInterpolants, 18877 SizeOfPredicates, 281 NumberOfNonLiveVariables, 3343 ConjunctsInSsa, 349 ConjunctsInUnsatCore, 44 InterpolantComputations, 7 PerfectInterpolantSequences, 20/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown