/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-bad-ring.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:51:38,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:51:38,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:51:39,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:51:39,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:51:39,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:51:39,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:51:39,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:51:39,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:51:39,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:51:39,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:51:39,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:51:39,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:51:39,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:51:39,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:51:39,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:51:39,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:51:39,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:51:39,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:51:39,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:51:39,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:51:39,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:51:39,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:51:39,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:51:39,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:51:39,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:51:39,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:51:39,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:51:39,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:51:39,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:51:39,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:51:39,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:51:39,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:51:39,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:51:39,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:51:39,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:51:39,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:51:39,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:51:39,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:51:39,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:51:39,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:51:39,050 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 01:51:39,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:51:39,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:51:39,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:51:39,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:51:39,076 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:51:39,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:51:39,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:51:39,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:51:39,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:51:39,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:51:39,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:51:39,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:51:39,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:51:39,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:51:39,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:51:39,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:51:39,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:51:39,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:51:39,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:51:39,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:51:39,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:51:39,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:51:39,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:51:39,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:51:39,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:51:39,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:51:39,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:51:39,080 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:51:39,080 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 01:51:39,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:51:39,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:51:39,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:51:39,381 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:51:39,381 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:51:39,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-13 01:51:40,261 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:51:40,424 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:51:40,425 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-13 01:51:40,430 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6834f89/0ea155a69c8c4c959705b9da53389928/FLAG39bf18f0f [2022-12-13 01:51:40,445 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6834f89/0ea155a69c8c4c959705b9da53389928 [2022-12-13 01:51:40,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:51:40,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:51:40,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:51:40,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:51:40,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:51:40,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e947f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40, skipping insertion in model container [2022-12-13 01:51:40,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:51:40,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:51:40,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,646 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-bad-ring.wvr.c[3947,3960] [2022-12-13 01:51:40,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:51:40,663 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:51:40,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:40,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:40,704 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-bad-ring.wvr.c[3947,3960] [2022-12-13 01:51:40,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:51:40,717 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:51:40,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40 WrapperNode [2022-12-13 01:51:40,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:51:40,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:51:40,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:51:40,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:51:40,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,770 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-12-13 01:51:40,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:51:40,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:51:40,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:51:40,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:51:40,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,800 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:51:40,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:51:40,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:51:40,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:51:40,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (1/1) ... [2022-12-13 01:51:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:51:40,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:40,844 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 01:51:40,859 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 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:51:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:51:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:51:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:51:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:51:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:51:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:51:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:51:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 01:51:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:51:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:51:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:51:40,871 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 01:51:40,946 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:51:40,948 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:51:41,340 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:51:41,492 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:51:41,492 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 01:51:41,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:51:41 BoogieIcfgContainer [2022-12-13 01:51:41,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:51:41,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:51:41,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:51:41,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:51:41,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:51:40" (1/3) ... [2022-12-13 01:51:41,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5d99ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:51:41, skipping insertion in model container [2022-12-13 01:51:41,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:40" (2/3) ... [2022-12-13 01:51:41,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5d99ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:51:41, skipping insertion in model container [2022-12-13 01:51:41,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:51:41" (3/3) ... [2022-12-13 01:51:41,501 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-12-13 01:51:41,515 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:51:41,515 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:51:41,515 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:51:41,600 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:51:41,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 514 flow [2022-12-13 01:51:41,716 INFO L130 PetriNetUnfolder]: 22/242 cut-off events. [2022-12-13 01:51:41,717 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:51:41,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 242 events. 22/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-13 01:51:41,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 514 flow [2022-12-13 01:51:41,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 232 transitions, 482 flow [2022-12-13 01:51:41,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:41,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-13 01:51:41,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 232 transitions, 482 flow [2022-12-13 01:51:41,793 INFO L130 PetriNetUnfolder]: 22/232 cut-off events. [2022-12-13 01:51:41,793 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:51:41,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 232 events. 22/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-13 01:51:41,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-13 01:51:41,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-13 01:51:49,740 INFO L241 LiptonReduction]: Total number of compositions: 200 [2022-12-13 01:51:49,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:51:49,755 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;@4fecf545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:51:49,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:51:49,760 INFO L130 PetriNetUnfolder]: 7/30 cut-off events. [2022-12-13 01:51:49,760 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:51:49,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:49,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:49,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -32754915, now seen corresponding path program 1 times [2022-12-13 01:51:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:49,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017295144] [2022-12-13 01:51:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:50,068 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 01:51:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:50,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017295144] [2022-12-13 01:51:50,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017295144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:50,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:50,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:51:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878129609] [2022-12-13 01:51:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:50,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:51:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:51:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:51:50,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:51:50,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 01:51:50,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:50,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:51:50,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:50,227 INFO L130 PetriNetUnfolder]: 472/690 cut-off events. [2022-12-13 01:51:50,228 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 01:51:50,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 690 events. 472/690 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2132 event pairs, 135 based on Foata normal form. 30/575 useless extension candidates. Maximal degree in co-relation 1216. Up to 449 conditions per place. [2022-12-13 01:51:50,233 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-13 01:51:50,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 196 flow [2022-12-13 01:51:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:51:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:51:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 01:51:50,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-13 01:51:50,245 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 80 flow. Second operand 3 states and 47 transitions. [2022-12-13 01:51:50,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 196 flow [2022-12-13 01:51:50,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:51:50,253 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 87 flow [2022-12-13 01:51:50,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2022-12-13 01:51:50,258 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-13 01:51:50,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:50,261 INFO L89 Accepts]: Start accepts. Operand has 31 places, 32 transitions, 87 flow [2022-12-13 01:51:50,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:50,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:50,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-13 01:51:50,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 32 transitions, 87 flow [2022-12-13 01:51:50,284 INFO L130 PetriNetUnfolder]: 14/43 cut-off events. [2022-12-13 01:51:50,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:51:50,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 43 events. 14/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 17 conditions per place. [2022-12-13 01:51:50,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-13 01:51:50,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-13 01:51:50,302 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:51:50,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 01:51:50,303 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 87 flow [2022-12-13 01:51:50,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 01:51:50,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:50,304 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:50,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:51:50,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2034944899, now seen corresponding path program 1 times [2022-12-13 01:51:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:50,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869846191] [2022-12-13 01:51:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:50,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:50,452 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 01:51:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:50,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869846191] [2022-12-13 01:51:50,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869846191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:50,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:50,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:51:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135494706] [2022-12-13 01:51:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:50,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:51:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:51:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:51:50,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:51:50,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 01:51:50,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:50,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:51:50,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:50,614 INFO L130 PetriNetUnfolder]: 529/810 cut-off events. [2022-12-13 01:51:50,614 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 01:51:50,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 810 events. 529/810 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2610 event pairs, 371 based on Foata normal form. 52/712 useless extension candidates. Maximal degree in co-relation 753. Up to 691 conditions per place. [2022-12-13 01:51:50,618 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 31 selfloop transitions, 2 changer transitions 27/60 dead transitions. [2022-12-13 01:51:50,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 60 transitions, 269 flow [2022-12-13 01:51:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:51:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:51:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 01:51:50,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-13 01:51:50,619 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 87 flow. Second operand 5 states and 64 transitions. [2022-12-13 01:51:50,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 60 transitions, 269 flow [2022-12-13 01:51:50,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:51:50,621 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 114 flow [2022-12-13 01:51:50,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-13 01:51:50,621 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-13 01:51:50,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:50,622 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 114 flow [2022-12-13 01:51:50,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:50,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:50,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 114 flow [2022-12-13 01:51:50,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 114 flow [2022-12-13 01:51:50,629 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-13 01:51:50,629 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-13 01:51:50,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 62 events. 22/62 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 146 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 19 conditions per place. [2022-12-13 01:51:50,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 114 flow [2022-12-13 01:51:50,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-13 01:51:52,022 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:52,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1401 [2022-12-13 01:51:52,024 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 110 flow [2022-12-13 01:51:52,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 01:51:52,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:52,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:52,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:51:52,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 602269161, now seen corresponding path program 1 times [2022-12-13 01:51:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:52,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010815897] [2022-12-13 01:51:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:52,146 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 01:51:52,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:52,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010815897] [2022-12-13 01:51:52,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010815897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:52,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:52,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:51:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949269893] [2022-12-13 01:51:52,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:52,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:51:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:52,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:51:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:51:52,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:51:52,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 01:51:52,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:52,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:51:52,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:52,314 INFO L130 PetriNetUnfolder]: 759/1166 cut-off events. [2022-12-13 01:51:52,314 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2022-12-13 01:51:52,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 1166 events. 759/1166 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4329 event pairs, 563 based on Foata normal form. 56/1039 useless extension candidates. Maximal degree in co-relation 3178. Up to 691 conditions per place. [2022-12-13 01:51:52,318 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 35/68 dead transitions. [2022-12-13 01:51:52,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 358 flow [2022-12-13 01:51:52,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:51:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:51:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-13 01:51:52,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 01:51:52,319 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 110 flow. Second operand 5 states and 70 transitions. [2022-12-13 01:51:52,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 358 flow [2022-12-13 01:51:52,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 336 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 01:51:52,321 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 118 flow [2022-12-13 01:51:52,321 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-13 01:51:52,322 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-13 01:51:52,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:52,322 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 118 flow [2022-12-13 01:51:52,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:52,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:52,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 118 flow [2022-12-13 01:51:52,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 118 flow [2022-12-13 01:51:52,329 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-13 01:51:52,329 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-13 01:51:52,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 62 events. 22/62 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 17 conditions per place. [2022-12-13 01:51:52,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 118 flow [2022-12-13 01:51:52,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-13 01:51:52,576 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:52,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-13 01:51:52,577 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 114 flow [2022-12-13 01:51:52,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 01:51:52,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:52,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:52,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:51:52,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1216932410, now seen corresponding path program 1 times [2022-12-13 01:51:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:52,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368716312] [2022-12-13 01:51:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:52,702 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 01:51:52,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:52,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368716312] [2022-12-13 01:51:52,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368716312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:52,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:52,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:51:52,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279692646] [2022-12-13 01:51:52,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:52,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:51:52,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:51:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:51:52,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:51:52,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 01:51:52,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:52,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:51:52,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:52,854 INFO L130 PetriNetUnfolder]: 797/1197 cut-off events. [2022-12-13 01:51:52,854 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-13 01:51:52,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1197 events. 797/1197 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4404 event pairs, 586 based on Foata normal form. 70/1030 useless extension candidates. Maximal degree in co-relation 3554. Up to 691 conditions per place. [2022-12-13 01:51:52,858 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 21/54 dead transitions. [2022-12-13 01:51:52,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 301 flow [2022-12-13 01:51:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:51:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:51:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 01:51:52,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-13 01:51:52,860 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 114 flow. Second operand 4 states and 53 transitions. [2022-12-13 01:51:52,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 301 flow [2022-12-13 01:51:52,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 261 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-13 01:51:52,863 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 108 flow [2022-12-13 01:51:52,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-13 01:51:52,865 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 01:51:52,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:52,865 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 108 flow [2022-12-13 01:51:52,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:52,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:52,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 108 flow [2022-12-13 01:51:52,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 108 flow [2022-12-13 01:51:52,873 INFO L130 PetriNetUnfolder]: 38/84 cut-off events. [2022-12-13 01:51:52,873 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:51:52,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 84 events. 38/84 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 10 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 160. Up to 33 conditions per place. [2022-12-13 01:51:52,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 108 flow [2022-12-13 01:51:52,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-13 01:51:53,103 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:53,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-13 01:51:53,104 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 104 flow [2022-12-13 01:51:53,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 01:51:53,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:53,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:53,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:51:53,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:53,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash -582879671, now seen corresponding path program 1 times [2022-12-13 01:51:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:53,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563557888] [2022-12-13 01:51:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:53,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:53,221 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 01:51:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:53,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563557888] [2022-12-13 01:51:53,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563557888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:53,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:53,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:51:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483481278] [2022-12-13 01:51:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:53,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:51:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:53,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:51:53,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:51:53,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:51:53,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 104 flow. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 01:51:53,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:53,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:51:53,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:53,356 INFO L130 PetriNetUnfolder]: 839/1226 cut-off events. [2022-12-13 01:51:53,356 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-12-13 01:51:53,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 1226 events. 839/1226 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4517 event pairs, 317 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 3344. Up to 645 conditions per place. [2022-12-13 01:51:53,361 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 46 selfloop transitions, 2 changer transitions 6/54 dead transitions. [2022-12-13 01:51:53,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 285 flow [2022-12-13 01:51:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:51:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:51:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-13 01:51:53,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-13 01:51:53,362 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 104 flow. Second operand 3 states and 51 transitions. [2022-12-13 01:51:53,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 285 flow [2022-12-13 01:51:53,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 277 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:51:53,363 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 110 flow [2022-12-13 01:51:53,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2022-12-13 01:51:53,364 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-13 01:51:53,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:53,364 INFO L89 Accepts]: Start accepts. Operand has 35 places, 33 transitions, 110 flow [2022-12-13 01:51:53,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:53,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:53,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-13 01:51:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 110 flow [2022-12-13 01:51:53,373 INFO L130 PetriNetUnfolder]: 46/107 cut-off events. [2022-12-13 01:51:53,373 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-13 01:51:53,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 107 events. 46/107 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 337 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 194. Up to 39 conditions per place. [2022-12-13 01:51:53,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-13 01:51:53,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 01:51:53,375 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:51:53,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 01:51:53,376 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 110 flow [2022-12-13 01:51:53,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 01:51:53,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:53,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:53,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:51:53,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:53,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash 971652712, now seen corresponding path program 1 times [2022-12-13 01:51:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:53,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541504537] [2022-12-13 01:51:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:53,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541504537] [2022-12-13 01:51:53,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541504537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:51:53,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565887783] [2022-12-13 01:51:53,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:53,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:51:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:53,521 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 01:51:53,526 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 01:51:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:53,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:51:53,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:51:53,797 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 01:51:53,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:51:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565887783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:53,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:51:53,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 01:51:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596476734] [2022-12-13 01:51:53,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:53,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:51:53,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:53,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:51:53,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:51:53,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:51:53,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:53,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:53,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:51:53,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:54,093 INFO L130 PetriNetUnfolder]: 1774/2682 cut-off events. [2022-12-13 01:51:54,093 INFO L131 PetriNetUnfolder]: For 1111/1111 co-relation queries the response was YES. [2022-12-13 01:51:54,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7582 conditions, 2682 events. 1774/2682 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12250 event pairs, 784 based on Foata normal form. 148/2294 useless extension candidates. Maximal degree in co-relation 4829. Up to 1227 conditions per place. [2022-12-13 01:51:54,100 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 32 selfloop transitions, 2 changer transitions 75/109 dead transitions. [2022-12-13 01:51:54,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 109 transitions, 554 flow [2022-12-13 01:51:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:51:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:51:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-13 01:51:54,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-13 01:51:54,103 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 110 flow. Second operand 7 states and 106 transitions. [2022-12-13 01:51:54,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 109 transitions, 554 flow [2022-12-13 01:51:54,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 109 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:51:54,105 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 146 flow [2022-12-13 01:51:54,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 01:51:54,107 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-13 01:51:54,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:54,107 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 146 flow [2022-12-13 01:51:54,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:54,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:54,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 146 flow [2022-12-13 01:51:54,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 146 flow [2022-12-13 01:51:54,119 INFO L130 PetriNetUnfolder]: 46/108 cut-off events. [2022-12-13 01:51:54,119 INFO L131 PetriNetUnfolder]: For 81/95 co-relation queries the response was YES. [2022-12-13 01:51:54,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 108 events. 46/108 cut-off events. For 81/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 346 event pairs, 14 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 293. Up to 39 conditions per place. [2022-12-13 01:51:54,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 146 flow [2022-12-13 01:51:54,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 01:51:55,817 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:55,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1710 [2022-12-13 01:51:55,817 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 142 flow [2022-12-13 01:51:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:55,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:55,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:55,827 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 01:51:56,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 01:51:56,025 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash -651039405, now seen corresponding path program 1 times [2022-12-13 01:51:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19280725] [2022-12-13 01:51:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:56,195 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 01:51:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:56,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19280725] [2022-12-13 01:51:56,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19280725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:56,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:56,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:51:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647063753] [2022-12-13 01:51:56,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:56,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:51:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:51:56,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:51:56,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:51:56,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:56,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:56,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:51:56,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:56,304 INFO L130 PetriNetUnfolder]: 658/961 cut-off events. [2022-12-13 01:51:56,304 INFO L131 PetriNetUnfolder]: For 1575/1575 co-relation queries the response was YES. [2022-12-13 01:51:56,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 961 events. 658/961 cut-off events. For 1575/1575 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3026 event pairs, 269 based on Foata normal form. 38/754 useless extension candidates. Maximal degree in co-relation 3443. Up to 512 conditions per place. [2022-12-13 01:51:56,308 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2022-12-13 01:51:56,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 300 flow [2022-12-13 01:51:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:51:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:51:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 01:51:56,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-13 01:51:56,310 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 142 flow. Second operand 3 states and 44 transitions. [2022-12-13 01:51:56,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 300 flow [2022-12-13 01:51:56,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 258 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-13 01:51:56,324 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 141 flow [2022-12-13 01:51:56,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2022-12-13 01:51:56,324 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-13 01:51:56,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:56,325 INFO L89 Accepts]: Start accepts. Operand has 38 places, 35 transitions, 141 flow [2022-12-13 01:51:56,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:56,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:56,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-13 01:51:56,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 141 flow [2022-12-13 01:51:56,333 INFO L130 PetriNetUnfolder]: 33/105 cut-off events. [2022-12-13 01:51:56,333 INFO L131 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2022-12-13 01:51:56,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 105 events. 33/105 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 8 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 205. Up to 29 conditions per place. [2022-12-13 01:51:56,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-13 01:51:56,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 01:51:56,335 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:51:56,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 01:51:56,336 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 141 flow [2022-12-13 01:51:56,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:56,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:56,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:56,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:51:56,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash -965008021, now seen corresponding path program 2 times [2022-12-13 01:51:56,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:56,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145619773] [2022-12-13 01:51:56,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:56,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:57,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:57,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145619773] [2022-12-13 01:51:57,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145619773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:51:57,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641291675] [2022-12-13 01:51:57,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:51:57,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:51:57,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:57,629 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 01:51:57,631 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 01:51:57,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:51:57,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:51:57,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 01:51:57,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:51:57,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:51:57,964 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 01:51:57,998 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 01:51:58,022 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 01:51:58,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:51:58,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641291675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:58,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:51:58,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2022-12-13 01:51:58,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138184058] [2022-12-13 01:51:58,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:58,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:51:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:58,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:51:58,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-12-13 01:51:58,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:51:58,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:58,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:58,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:51:58,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:58,289 INFO L130 PetriNetUnfolder]: 1151/1730 cut-off events. [2022-12-13 01:51:58,290 INFO L131 PetriNetUnfolder]: For 1351/1351 co-relation queries the response was YES. [2022-12-13 01:51:58,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 1730 events. 1151/1730 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6754 event pairs, 507 based on Foata normal form. 12/1324 useless extension candidates. Maximal degree in co-relation 4191. Up to 962 conditions per place. [2022-12-13 01:51:58,296 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 92 selfloop transitions, 8 changer transitions 2/102 dead transitions. [2022-12-13 01:51:58,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 102 transitions, 611 flow [2022-12-13 01:51:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:51:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:51:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-13 01:51:58,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 01:51:58,297 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 141 flow. Second operand 7 states and 91 transitions. [2022-12-13 01:51:58,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 102 transitions, 611 flow [2022-12-13 01:51:58,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 102 transitions, 568 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 01:51:58,299 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 198 flow [2022-12-13 01:51:58,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 01:51:58,300 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-13 01:51:58,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:58,300 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 198 flow [2022-12-13 01:51:58,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:58,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:58,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 198 flow [2022-12-13 01:51:58,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 198 flow [2022-12-13 01:51:58,316 INFO L130 PetriNetUnfolder]: 76/222 cut-off events. [2022-12-13 01:51:58,317 INFO L131 PetriNetUnfolder]: For 177/191 co-relation queries the response was YES. [2022-12-13 01:51:58,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 222 events. 76/222 cut-off events. For 177/191 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 951 event pairs, 12 based on Foata normal form. 1/169 useless extension candidates. Maximal degree in co-relation 302. Up to 59 conditions per place. [2022-12-13 01:51:58,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 198 flow [2022-12-13 01:51:58,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 01:52:02,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:02,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:02,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-13 01:52:02,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-13 01:52:02,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1118] L142-3-->L142-2: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet28#1_72| v_~q2_front~0_136) (<= |v_ULTIMATE.start_main_#t~nondet27#1_56| 2147483647) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) (<= |v_ULTIMATE.start_main_#t~nondet29#1_64| 2147483647) (= |v_ULTIMATE.start_main_#t~nondet29#1_64| v_~q3_front~0_122) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_189| (ite (<= 0 v_~N~0_76) 1 0)) (= v_~q2_front~0_136 v_~q2_back~0_142) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_189| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_235|) (= (+ |v_ULTIMATE.start_main_#t~pre30#1_49| 1) |v_#pthreadsForks_120|) (= (let ((.cse0 (store |v_#memory_int_348| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_348| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_51| |v_ULTIMATE.start_main_#t~pre32#1_62|)))) (store .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre30#1_49|))) |v_#memory_int_346|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_64| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_56| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_114| v_~q3~0.offset_99) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_196| |v_ULTIMATE.start_create_fresh_int_array_~size#1_192|)) (= (+ |v_#pthreadsForks_122| 1) |v_ULTIMATE.start_main_#t~pre30#1_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_114| v_~q3~0.base_99) (= |v_ULTIMATE.start_main_#t~nondet27#1_56| v_~q1_front~0_143) (= |v_ULTIMATE.start_main_#t~pre32#1_62| |v_#pthreadsForks_122|) (= v_~q3_front~0_122 v_~q3_back~0_136) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_164|) (<= |v_ULTIMATE.start_main_#t~nondet28#1_72| 2147483647) (= v_~q1_front~0_143 v_~q1_back~0_190) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_72| 2147483648)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_235| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_164|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_196|, ~N~0=v_~N~0_76, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_64|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_192|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_56|, #pthreadsForks=|v_#pthreadsForks_122|, #memory_int=|v_#memory_int_348|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_72|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_164|, ~q1_front~0=v_~q1_front~0_143, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_47|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_196|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_114|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_49|, ~q3_front~0=v_~q3_front~0_122, ~q3_back~0=v_~q3_back~0_136, #pthreadsForks=|v_#pthreadsForks_120|, ~q1_back~0=v_~q1_back~0_190, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_235|, ~q3~0.base=v_~q3~0.base_99, ~q2_back~0=v_~q2_back~0_142, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_35|, ~q2_front~0=v_~q2_front~0_136, ~N~0=v_~N~0_76, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_62|, ~q3~0.offset=v_~q3~0.offset_99, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_192|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_114|, #memory_int=|v_#memory_int_346|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_189|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet31#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_#t~pre32#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:03,118 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:52:03,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4819 [2022-12-13 01:52:03,119 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 232 flow [2022-12-13 01:52:03,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:03,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:03,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:03,136 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 01:52:03,325 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,SelfDestructingSolverStorable7 [2022-12-13 01:52:03,325 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1966629878, now seen corresponding path program 1 times [2022-12-13 01:52:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:03,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125849104] [2022-12-13 01:52:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:03,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125849104] [2022-12-13 01:52:03,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125849104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:03,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916371194] [2022-12-13 01:52:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:03,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:03,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:03,977 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 01:52:03,979 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 01:52:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:04,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 01:52:04,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:04,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:04,153 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 01:52:04,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:04,179 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 01:52:04,200 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 01:52:04,214 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 01:52:04,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:04,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916371194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:04,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:04,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-13 01:52:04,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871086563] [2022-12-13 01:52:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:04,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:52:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:04,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:52:04,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:52:04,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 01:52:04,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 01:52:04,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:04,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 01:52:04,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:04,516 INFO L130 PetriNetUnfolder]: 1002/1510 cut-off events. [2022-12-13 01:52:04,516 INFO L131 PetriNetUnfolder]: For 2231/2231 co-relation queries the response was YES. [2022-12-13 01:52:04,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5385 conditions, 1510 events. 1002/1510 cut-off events. For 2231/2231 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5799 event pairs, 433 based on Foata normal form. 6/1178 useless extension candidates. Maximal degree in co-relation 3321. Up to 960 conditions per place. [2022-12-13 01:52:04,523 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 81 selfloop transitions, 6 changer transitions 29/116 dead transitions. [2022-12-13 01:52:04,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 116 transitions, 773 flow [2022-12-13 01:52:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:52:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:52:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 01:52:04,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 01:52:04,524 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 232 flow. Second operand 8 states and 104 transitions. [2022-12-13 01:52:04,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 116 transitions, 773 flow [2022-12-13 01:52:04,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 116 transitions, 717 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 01:52:04,527 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 200 flow [2022-12-13 01:52:04,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=200, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2022-12-13 01:52:04,528 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-13 01:52:04,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:04,528 INFO L89 Accepts]: Start accepts. Operand has 54 places, 40 transitions, 200 flow [2022-12-13 01:52:04,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:04,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:04,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 200 flow [2022-12-13 01:52:04,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 200 flow [2022-12-13 01:52:04,544 INFO L130 PetriNetUnfolder]: 74/216 cut-off events. [2022-12-13 01:52:04,544 INFO L131 PetriNetUnfolder]: For 198/202 co-relation queries the response was YES. [2022-12-13 01:52:04,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 216 events. 74/216 cut-off events. For 198/202 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 939 event pairs, 24 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 302. Up to 57 conditions per place. [2022-12-13 01:52:04,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 200 flow [2022-12-13 01:52:04,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 01:52:04,546 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:52:04,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 01:52:04,546 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 200 flow [2022-12-13 01:52:04,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 01:52:04,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:04,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:04,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 01:52:04,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:04,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1252749932, now seen corresponding path program 1 times [2022-12-13 01:52:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172708605] [2022-12-13 01:52:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172708605] [2022-12-13 01:52:05,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172708605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005072176] [2022-12-13 01:52:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:05,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:05,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:05,363 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 01:52:05,365 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 01:52:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:05,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:52:05,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:05,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:05,568 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 01:52:05,584 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 01:52:05,597 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 01:52:05,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:05,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005072176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:05,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:05,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-13 01:52:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110253701] [2022-12-13 01:52:05,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:05,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:52:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:52:05,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:52:05,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 01:52:05,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:05,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:05,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 01:52:05,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:05,814 INFO L130 PetriNetUnfolder]: 778/1214 cut-off events. [2022-12-13 01:52:05,815 INFO L131 PetriNetUnfolder]: For 1920/1920 co-relation queries the response was YES. [2022-12-13 01:52:05,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 1214 events. 778/1214 cut-off events. For 1920/1920 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4524 event pairs, 264 based on Foata normal form. 18/986 useless extension candidates. Maximal degree in co-relation 2712. Up to 983 conditions per place. [2022-12-13 01:52:05,821 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 9 changer transitions 2/75 dead transitions. [2022-12-13 01:52:05,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 490 flow [2022-12-13 01:52:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:52:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:52:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-13 01:52:05,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29464285714285715 [2022-12-13 01:52:05,822 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 200 flow. Second operand 7 states and 66 transitions. [2022-12-13 01:52:05,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 490 flow [2022-12-13 01:52:05,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 453 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 01:52:05,826 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 242 flow [2022-12-13 01:52:05,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-13 01:52:05,827 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-13 01:52:05,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:05,827 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 242 flow [2022-12-13 01:52:05,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:05,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:05,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 242 flow [2022-12-13 01:52:05,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 242 flow [2022-12-13 01:52:05,844 INFO L130 PetriNetUnfolder]: 85/229 cut-off events. [2022-12-13 01:52:05,844 INFO L131 PetriNetUnfolder]: For 206/207 co-relation queries the response was YES. [2022-12-13 01:52:05,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 229 events. 85/229 cut-off events. For 206/207 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 919 event pairs, 20 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 466. Up to 69 conditions per place. [2022-12-13 01:52:05,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 242 flow [2022-12-13 01:52:05,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-13 01:52:05,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-13 01:52:05,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-13 01:52:06,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:52:06,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 01:52:06,061 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 244 flow [2022-12-13 01:52:06,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:06,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:06,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:06,073 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 01:52:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:06,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash -711328848, now seen corresponding path program 1 times [2022-12-13 01:52:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:06,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087626464] [2022-12-13 01:52:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:06,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087626464] [2022-12-13 01:52:06,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087626464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:06,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362223165] [2022-12-13 01:52:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:06,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:06,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:06,834 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 01:52:06,836 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 01:52:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:06,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 01:52:06,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:07,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:07,038 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 01:52:07,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:07,066 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 01:52:07,088 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 01:52:07,102 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 01:52:07,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:07,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362223165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:07,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:07,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-13 01:52:07,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556622925] [2022-12-13 01:52:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:07,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:52:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:52:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:52:07,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:52:07,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 01:52:07,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:07,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:52:07,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:07,382 INFO L130 PetriNetUnfolder]: 691/1072 cut-off events. [2022-12-13 01:52:07,382 INFO L131 PetriNetUnfolder]: For 1984/1984 co-relation queries the response was YES. [2022-12-13 01:52:07,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4035 conditions, 1072 events. 691/1072 cut-off events. For 1984/1984 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4005 event pairs, 68 based on Foata normal form. 20/870 useless extension candidates. Maximal degree in co-relation 2957. Up to 584 conditions per place. [2022-12-13 01:52:07,389 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 77 selfloop transitions, 15 changer transitions 0/92 dead transitions. [2022-12-13 01:52:07,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 650 flow [2022-12-13 01:52:07,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:52:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:52:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-12-13 01:52:07,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2647058823529412 [2022-12-13 01:52:07,390 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 244 flow. Second operand 9 states and 81 transitions. [2022-12-13 01:52:07,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 650 flow [2022-12-13 01:52:07,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 625 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 01:52:07,394 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 302 flow [2022-12-13 01:52:07,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2022-12-13 01:52:07,395 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-12-13 01:52:07,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:07,395 INFO L89 Accepts]: Start accepts. Operand has 61 places, 48 transitions, 302 flow [2022-12-13 01:52:07,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:07,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:07,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 48 transitions, 302 flow [2022-12-13 01:52:07,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 302 flow [2022-12-13 01:52:07,417 INFO L130 PetriNetUnfolder]: 105/264 cut-off events. [2022-12-13 01:52:07,417 INFO L131 PetriNetUnfolder]: For 399/399 co-relation queries the response was YES. [2022-12-13 01:52:07,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 264 events. 105/264 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1087 event pairs, 28 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 481. Up to 84 conditions per place. [2022-12-13 01:52:07,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 48 transitions, 302 flow [2022-12-13 01:52:07,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 01:52:07,420 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:52:07,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 01:52:07,421 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 302 flow [2022-12-13 01:52:07,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 01:52:07,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:07,421 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:07,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 01:52:07,628 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 01:52:07,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1891478733, now seen corresponding path program 1 times [2022-12-13 01:52:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:07,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392582220] [2022-12-13 01:52:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:07,710 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 01:52:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:07,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392582220] [2022-12-13 01:52:07,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392582220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:07,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782294547] [2022-12-13 01:52:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:07,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:07,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:07,712 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 01:52:07,714 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 01:52:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:07,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:52:07,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:07,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:07,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782294547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:07,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:07,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 01:52:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467804984] [2022-12-13 01:52:07,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:07,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:52:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:07,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:52:07,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:52:07,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:52:07,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:07,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:07,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:52:07,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:08,195 INFO L130 PetriNetUnfolder]: 1449/2356 cut-off events. [2022-12-13 01:52:08,195 INFO L131 PetriNetUnfolder]: For 5319/5319 co-relation queries the response was YES. [2022-12-13 01:52:08,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9296 conditions, 2356 events. 1449/2356 cut-off events. For 5319/5319 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10808 event pairs, 610 based on Foata normal form. 240/2234 useless extension candidates. Maximal degree in co-relation 4051. Up to 1073 conditions per place. [2022-12-13 01:52:08,208 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 46 selfloop transitions, 3 changer transitions 78/127 dead transitions. [2022-12-13 01:52:08,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 127 transitions, 1028 flow [2022-12-13 01:52:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:52:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:52:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-13 01:52:08,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40336134453781514 [2022-12-13 01:52:08,210 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 302 flow. Second operand 7 states and 96 transitions. [2022-12-13 01:52:08,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 127 transitions, 1028 flow [2022-12-13 01:52:08,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 127 transitions, 955 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 01:52:08,217 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 300 flow [2022-12-13 01:52:08,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2022-12-13 01:52:08,218 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-12-13 01:52:08,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:08,218 INFO L89 Accepts]: Start accepts. Operand has 69 places, 49 transitions, 300 flow [2022-12-13 01:52:08,219 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:08,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:08,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 49 transitions, 300 flow [2022-12-13 01:52:08,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 49 transitions, 300 flow [2022-12-13 01:52:08,240 INFO L130 PetriNetUnfolder]: 105/266 cut-off events. [2022-12-13 01:52:08,240 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-13 01:52:08,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 266 events. 105/266 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1084 event pairs, 28 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 496. Up to 84 conditions per place. [2022-12-13 01:52:08,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 49 transitions, 300 flow [2022-12-13 01:52:08,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 01:52:11,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:52:11,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2942 [2022-12-13 01:52:11,160 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 297 flow [2022-12-13 01:52:11,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:11,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:11,161 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:11,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 01:52:11,361 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 01:52:11,361 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1866534583, now seen corresponding path program 1 times [2022-12-13 01:52:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:11,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321355315] [2022-12-13 01:52:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:11,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321355315] [2022-12-13 01:52:11,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321355315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:11,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:52:11,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:52:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62634687] [2022-12-13 01:52:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:11,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:52:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:52:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:52:11,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:52:11,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:11,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:11,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:52:11,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:11,756 INFO L130 PetriNetUnfolder]: 1179/1792 cut-off events. [2022-12-13 01:52:11,756 INFO L131 PetriNetUnfolder]: For 4252/4252 co-relation queries the response was YES. [2022-12-13 01:52:11,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7551 conditions, 1792 events. 1179/1792 cut-off events. For 4252/4252 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7232 event pairs, 204 based on Foata normal form. 64/1496 useless extension candidates. Maximal degree in co-relation 4424. Up to 739 conditions per place. [2022-12-13 01:52:11,769 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 68 selfloop transitions, 17 changer transitions 0/85 dead transitions. [2022-12-13 01:52:11,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 661 flow [2022-12-13 01:52:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:52:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:52:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-13 01:52:11,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40588235294117647 [2022-12-13 01:52:11,770 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 297 flow. Second operand 5 states and 69 transitions. [2022-12-13 01:52:11,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 661 flow [2022-12-13 01:52:11,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 617 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-13 01:52:11,777 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 419 flow [2022-12-13 01:52:11,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2022-12-13 01:52:11,778 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-13 01:52:11,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:11,778 INFO L89 Accepts]: Start accepts. Operand has 64 places, 56 transitions, 419 flow [2022-12-13 01:52:11,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:11,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:11,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 56 transitions, 419 flow [2022-12-13 01:52:11,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 419 flow [2022-12-13 01:52:11,814 INFO L130 PetriNetUnfolder]: 185/448 cut-off events. [2022-12-13 01:52:11,814 INFO L131 PetriNetUnfolder]: For 740/744 co-relation queries the response was YES. [2022-12-13 01:52:11,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 448 events. 185/448 cut-off events. For 740/744 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2200 event pairs, 8 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 979. Up to 164 conditions per place. [2022-12-13 01:52:11,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 56 transitions, 419 flow [2022-12-13 01:52:11,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 01:52:11,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-13 01:52:11,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:52:11,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-13 01:52:11,958 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 422 flow [2022-12-13 01:52:11,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:11,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:11,958 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:11,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 01:52:11,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash -512820801, now seen corresponding path program 2 times [2022-12-13 01:52:11,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:11,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344897766] [2022-12-13 01:52:11,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:12,705 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 01:52:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:12,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344897766] [2022-12-13 01:52:12,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344897766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:12,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120765433] [2022-12-13 01:52:12,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:52:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:12,707 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 01:52:12,710 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 01:52:12,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:52:12,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:52:12,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 01:52:12,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:12,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:12,950 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 01:52:12,988 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 25 treesize of output 7 [2022-12-13 01:52:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:13,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:13,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120765433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:13,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:13,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2022-12-13 01:52:13,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926364134] [2022-12-13 01:52:13,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:13,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:52:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:52:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-12-13 01:52:13,046 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 01:52:13,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 422 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:13,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:13,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 01:52:13,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:13,473 INFO L130 PetriNetUnfolder]: 1663/2544 cut-off events. [2022-12-13 01:52:13,473 INFO L131 PetriNetUnfolder]: For 6164/6164 co-relation queries the response was YES. [2022-12-13 01:52:13,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10976 conditions, 2544 events. 1663/2544 cut-off events. For 6164/6164 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10959 event pairs, 636 based on Foata normal form. 0/2036 useless extension candidates. Maximal degree in co-relation 4530. Up to 1789 conditions per place. [2022-12-13 01:52:13,487 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 97 selfloop transitions, 10 changer transitions 7/114 dead transitions. [2022-12-13 01:52:13,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 114 transitions, 960 flow [2022-12-13 01:52:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:52:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:52:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 01:52:13,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29285714285714287 [2022-12-13 01:52:13,488 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 422 flow. Second operand 8 states and 82 transitions. [2022-12-13 01:52:13,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 114 transitions, 960 flow [2022-12-13 01:52:13,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 900 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-13 01:52:13,492 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 503 flow [2022-12-13 01:52:13,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=503, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2022-12-13 01:52:13,493 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2022-12-13 01:52:13,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:13,493 INFO L89 Accepts]: Start accepts. Operand has 76 places, 65 transitions, 503 flow [2022-12-13 01:52:13,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:13,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:13,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 65 transitions, 503 flow [2022-12-13 01:52:13,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 503 flow [2022-12-13 01:52:13,547 INFO L130 PetriNetUnfolder]: 262/647 cut-off events. [2022-12-13 01:52:13,548 INFO L131 PetriNetUnfolder]: For 986/988 co-relation queries the response was YES. [2022-12-13 01:52:13,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 647 events. 262/647 cut-off events. For 986/988 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3540 event pairs, 13 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 939. Up to 238 conditions per place. [2022-12-13 01:52:13,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 65 transitions, 503 flow [2022-12-13 01:52:13,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-13 01:52:13,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_69| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (= (ite |v_thread3_#t~short18#1_70| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_70|, |v_thread3_#t~short18#1_69|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:13,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:14,081 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:14,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1127] L98-2-->L142-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_175|) |v_thread3_#t~short18#1_136| (<= |v_ULTIMATE.start_main_#t~nondet28#1_82| 2147483647) (not (= (ite (and (<= 0 v_~q2_front~0_145) (< v_~q2_front~0_145 v_~q2_back~0_152) (< v_~q2_front~0_145 v_~n2~0_116)) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_243|) (= |v_ULTIMATE.start_main_#t~pre30#1_61| |v_#pthreadsForks_151|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_74| 2147483648)) (= v_~q1_front~0_169 v_~q1_back~0_238) (<= |v_ULTIMATE.start_main_#t~nondet29#1_74| 2147483647) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_176|) (= (+ |v_#pthreadsForks_151| 1) |v_#pthreadsForks_150|) (= |v_thread3Thread1of1ForFork2_~k~0#1_45| (+ (select (select |v_#memory_int_401| v_~q3~0.base_106) (+ v_~q3~0.offset_106 (* 4 v_~q3_back~0_144))) 1)) (= |v_ULTIMATE.start_main_#t~nondet29#1_74| v_~q3_front~0_128) (= (select (select |v_#memory_int_401| v_~q2~0.base_107) (+ v_~q2~0.offset_107 (* v_~q2_front~0_145 4))) |v_thread3Thread1of1ForFork2_~k~0#1_45|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_66| 2147483648)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_212| |v_ULTIMATE.start_create_fresh_int_array_~size#1_204|)) (= v_~q3_front~0_128 v_~q3_back~0_142) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_82| 2147483648)) (= |v_thread3Thread1of1ForFork2_~t~0#1_43| (+ |v_thread3Thread1of1ForFork2_~t~0#1_44| |v_thread3Thread1of1ForFork2_~k~0#1_45|)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= v_~q3~0.base_105 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_122|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_243| 0)) (= v_~q2_front~0_143 v_~q2_back~0_151) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= 0 v_~N~0_98) 1 0)) (<= |v_ULTIMATE.start_main_#t~nondet27#1_66| 2147483647) (= |v_ULTIMATE.start_main_#t~nondet27#1_66| v_~q1_front~0_169) (= (ite |v_thread3_#t~short18#1_135| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_122| v_~q3~0.offset_105) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_45| 0)) (< v_~q3_back~0_144 v_~n3~0_106) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_49| |v_ULTIMATE.start_main_#t~pre30#1_61|)) |v_#memory_int_400|) (<= 0 v_~q3_back~0_144) (= |v_ULTIMATE.start_main_#t~nondet28#1_82| v_~q2_front~0_143)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_175|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_176|, ~n2~0=v_~n2~0_116, ~n3~0=v_~n3~0_106, ~q2~0.offset=v_~q2~0.offset_107, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_212|, ~q2_front~0=v_~q2_front~0_145, ~N~0=v_~N~0_98, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_74|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_49|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_204|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_66|, ~q3~0.offset=v_~q3~0.offset_106, ~q3_back~0=v_~q3_back~0_144, #pthreadsForks=|v_#pthreadsForks_151|, #memory_int=|v_#memory_int_401|, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_107, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_44|, ~q2_back~0=v_~q2_back~0_152, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_82|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_175|, ~q1_front~0=v_~q1_front~0_169, ~n3~0=v_~n3~0_106, ~q2~0.offset=v_~q2~0.offset_107, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_212|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_29|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_122|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_49|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_29|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_61|, ~q3_front~0=v_~q3_front~0_128, ~q3_back~0=v_~q3_back~0_142, #pthreadsForks=|v_#pthreadsForks_150|, ~q1_back~0=v_~q1_back~0_238, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_243|, ~q3~0.base=v_~q3~0.base_105, ~q2~0.base=v_~q2~0.base_107, ~q2_back~0=v_~q2_back~0_151, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_53|, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_45|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_27|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_176|, ~n2~0=v_~n2~0_116, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_27|, ~q2_front~0=v_~q2_front~0_143, ~N~0=v_~N~0_98, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_29|, ~q3~0.offset=v_~q3~0.offset_105, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_204|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_122|, #memory_int=|v_#memory_int_400|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_43|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|} AuxVars[|v_thread3_#t~short18#1_135|, |v_thread3_#t~short18#1_136|] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, thread3Thread1of1ForFork2_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, thread3Thread1of1ForFork2_#t~mem15#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, thread3Thread1of1ForFork2_~k~0#1, thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~mem17#1, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #memory_int, thread3Thread1of1ForFork2_~t~0#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:15,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1129] L143-4-->L142-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_126| v_~q3~0.offset_111) (= |v_ULTIMATE.start_main_#t~pre34#1_70| |v_#pthreadsForks_162|) (<= |v_ULTIMATE.start_main_#t~nondet29#1_82| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_90| 2147483648)) (= v_~q3~0.base_111 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_126|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_180|) (= (let ((.cse0 (store |v_#memory_int_412| |v_ULTIMATE.start_main_~#t3~0#1.base_75| (store (select |v_#memory_int_412| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) |v_ULTIMATE.start_main_~#t3~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre34#1_70|)))) (store .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_53| |v_ULTIMATE.start_main_#t~pre30#1_65|))) |v_#memory_int_410|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_82| 2147483648)) (= |v_#pthreadsForks_160| (+ 2 |v_#pthreadsForks_162|)) (= v_~q1_front~0_173 v_~q1_back~0_242) (= |v_ULTIMATE.start_main_#t~nondet28#1_90| v_~q2_front~0_151) (= (+ |v_ULTIMATE.start_main_#t~pre30#1_65| 1) |v_#pthreadsForks_160|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_74| 2147483648)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247| 0)) (= v_~q3_front~0_132 v_~q3_back~0_150) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_179|) (= |v_ULTIMATE.start_main_#t~nondet27#1_74| v_~q1_front~0_173) (<= |v_ULTIMATE.start_main_#t~nondet28#1_90| 2147483647) (<= |v_ULTIMATE.start_main_#t~nondet27#1_74| 2147483647) (= |v_ULTIMATE.start_main_#t~nondet29#1_82| v_~q3_front~0_132) (= v_~q2_front~0_151 v_~q2_back~0_157) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_201| (ite (<= 0 v_~N~0_102) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_201| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_216| |v_ULTIMATE.start_create_fresh_int_array_~size#1_208|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_179|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_180|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_72|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_216|, ~N~0=v_~N~0_102, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_82|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_208|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_74|, #pthreadsForks=|v_#pthreadsForks_162|, #memory_int=|v_#memory_int_412|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_90|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_179|, ~q1_front~0=v_~q1_front~0_173, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_72|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_57|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_216|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_70|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_126|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_65|, ~q3_front~0=v_~q3_front~0_132, ~q3_back~0=v_~q3_back~0_150, #pthreadsForks=|v_#pthreadsForks_160|, ~q1_back~0=v_~q1_back~0_242, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|, ~q3~0.base=v_~q3~0.base_111, ~q2_back~0=v_~q2_back~0_157, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_180|, ~q2_front~0=v_~q2_front~0_151, ~N~0=v_~N~0_102, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_80|, ~q3~0.offset=v_~q3~0.offset_111, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_208|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_126|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_54|, #memory_int=|v_#memory_int_410|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_201|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_#t~pre32#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 01:52:21,720 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:52:21,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8227 [2022-12-13 01:52:21,720 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 559 flow [2022-12-13 01:52:21,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:52:21,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:21,721 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:21,727 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 01:52:21,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:21,926 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:21,926 INFO L85 PathProgramCache]: Analyzing trace with hash 742189341, now seen corresponding path program 1 times [2022-12-13 01:52:21,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:21,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447715678] [2022-12-13 01:52:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:23,069 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 01:52:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:23,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447715678] [2022-12-13 01:52:23,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447715678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:23,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012030566] [2022-12-13 01:52:23,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:23,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:23,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:23,071 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 01:52:23,081 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 01:52:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:23,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:52:23,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:23,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:23,289 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 01:52:23,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:23,342 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 01:52:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:23,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:23,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012030566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:23,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:23,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2022-12-13 01:52:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866698377] [2022-12-13 01:52:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:52:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:52:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-12-13 01:52:23,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:52:23,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 559 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 01:52:23,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:23,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:52:23,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:24,557 INFO L130 PetriNetUnfolder]: 1660/2545 cut-off events. [2022-12-13 01:52:24,557 INFO L131 PetriNetUnfolder]: For 5445/5445 co-relation queries the response was YES. [2022-12-13 01:52:24,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10436 conditions, 2545 events. 1660/2545 cut-off events. For 5445/5445 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10992 event pairs, 616 based on Foata normal form. 0/2038 useless extension candidates. Maximal degree in co-relation 4469. Up to 1295 conditions per place. [2022-12-13 01:52:24,570 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 95 selfloop transitions, 11 changer transitions 9/115 dead transitions. [2022-12-13 01:52:24,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 970 flow [2022-12-13 01:52:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:52:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:52:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-13 01:52:24,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-13 01:52:24,571 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 559 flow. Second operand 7 states and 85 transitions. [2022-12-13 01:52:24,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 970 flow [2022-12-13 01:52:24,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 940 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 01:52:24,576 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 512 flow [2022-12-13 01:52:24,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=512, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2022-12-13 01:52:24,577 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2022-12-13 01:52:24,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:24,577 INFO L89 Accepts]: Start accepts. Operand has 82 places, 64 transitions, 512 flow [2022-12-13 01:52:24,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:24,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:24,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 64 transitions, 512 flow [2022-12-13 01:52:24,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 64 transitions, 512 flow [2022-12-13 01:52:24,628 INFO L130 PetriNetUnfolder]: 270/655 cut-off events. [2022-12-13 01:52:24,628 INFO L131 PetriNetUnfolder]: For 1005/1005 co-relation queries the response was YES. [2022-12-13 01:52:24,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2182 conditions, 655 events. 270/655 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3558 event pairs, 36 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 1524. Up to 249 conditions per place. [2022-12-13 01:52:24,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 64 transitions, 512 flow [2022-12-13 01:52:24,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 01:52:24,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_69| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (= (ite |v_thread3_#t~short18#1_70| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_70|, |v_thread3_#t~short18#1_69|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-13 01:52:24,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-13 01:52:25,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-13 01:52:25,421 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:52:25,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 844 [2022-12-13 01:52:25,421 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 538 flow [2022-12-13 01:52:25,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 01:52:25,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:25,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:25,429 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 01:52:25,628 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,SelfDestructingSolverStorable14 [2022-12-13 01:52:25,629 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1735385462, now seen corresponding path program 1 times [2022-12-13 01:52:25,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:25,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833483235] [2022-12-13 01:52:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:25,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:26,534 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 01:52:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:26,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833483235] [2022-12-13 01:52:26,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833483235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:26,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529306927] [2022-12-13 01:52:26,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:26,539 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 01:52:26,541 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 01:52:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:26,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 01:52:26,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:26,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:26,801 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 01:52:26,854 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 01:52:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:26,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:26,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529306927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:26,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:26,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2022-12-13 01:52:26,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810766851] [2022-12-13 01:52:26,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:26,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:52:26,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:52:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-13 01:52:26,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:52:26,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 01:52:26,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:26,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:52:26,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:27,346 INFO L130 PetriNetUnfolder]: 1641/2502 cut-off events. [2022-12-13 01:52:27,346 INFO L131 PetriNetUnfolder]: For 5699/5699 co-relation queries the response was YES. [2022-12-13 01:52:27,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10345 conditions, 2502 events. 1641/2502 cut-off events. For 5699/5699 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10614 event pairs, 706 based on Foata normal form. 0/1996 useless extension candidates. Maximal degree in co-relation 7267. Up to 1314 conditions per place. [2022-12-13 01:52:27,359 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 93 selfloop transitions, 10 changer transitions 7/110 dead transitions. [2022-12-13 01:52:27,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 978 flow [2022-12-13 01:52:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:52:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:52:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-13 01:52:27,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30036630036630035 [2022-12-13 01:52:27,360 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 538 flow. Second operand 7 states and 82 transitions. [2022-12-13 01:52:27,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 978 flow [2022-12-13 01:52:27,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 927 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-13 01:52:27,366 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 557 flow [2022-12-13 01:52:27,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2022-12-13 01:52:27,367 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2022-12-13 01:52:27,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:27,367 INFO L89 Accepts]: Start accepts. Operand has 81 places, 65 transitions, 557 flow [2022-12-13 01:52:27,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:27,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:27,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 65 transitions, 557 flow [2022-12-13 01:52:27,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 65 transitions, 557 flow [2022-12-13 01:52:27,421 INFO L130 PetriNetUnfolder]: 270/650 cut-off events. [2022-12-13 01:52:27,422 INFO L131 PetriNetUnfolder]: For 1115/1116 co-relation queries the response was YES. [2022-12-13 01:52:27,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 650 events. 270/650 cut-off events. For 1115/1116 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3488 event pairs, 36 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1264. Up to 248 conditions per place. [2022-12-13 01:52:27,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 65 transitions, 557 flow [2022-12-13 01:52:27,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 01:52:27,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_69| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (= (ite |v_thread3_#t~short18#1_70| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_70|, |v_thread3_#t~short18#1_69|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-13 01:52:27,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1138] L76-2-->L144-3: Formula: (and (= (ite (and (<= 0 v_~q1_front~0_193) (< v_~q1_front~0_193 v_~q1_back~0_257) (< v_~q1_front~0_193 v_~n1~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_76| 0)) (= (+ |v_#pthreadsForks_183| 1) |v_#pthreadsForks_182|) (= |v_thread2Thread1of1ForFork1_~j~0#1_92| (select (select |v_#memory_int_451| v_~q1~0.base_152) (+ (* v_~q1_front~0_193 4) v_~q1~0.offset_151))) (= v_~q1_front~0_192 (+ v_~q1_front~0_193 1)) (= (store |v_#memory_int_451| |v_ULTIMATE.start_main_~#t3~0#1.base_87| (store (select |v_#memory_int_451| |v_ULTIMATE.start_main_~#t3~0#1.base_87|) |v_ULTIMATE.start_main_~#t3~0#1.offset_84| |v_ULTIMATE.start_main_#t~pre34#1_82|)) |v_#memory_int_450|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_76| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76|) (= |v_ULTIMATE.start_main_#t~pre34#1_82| |v_#pthreadsForks_183|)) InVars {~q1~0.offset=v_~q1~0.offset_151, #pthreadsForks=|v_#pthreadsForks_183|, ~q1_front~0=v_~q1_front~0_193, ~q1_back~0=v_~q1_back~0_257, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_84|, ~n1~0=v_~n1~0_136, ~q1~0.base=v_~q1~0.base_152, #memory_int=|v_#memory_int_451|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_87|} OutVars{~q1~0.offset=v_~q1~0.offset_151, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_92|, ~q1_front~0=v_~q1_front~0_192, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_84|, ~n1~0=v_~n1~0_136, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_82|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_92|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_76|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_42|, #pthreadsForks=|v_#pthreadsForks_182|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_66|, ~q1_back~0=v_~q1_back~0_257, ~q1~0.base=v_~q1~0.base_152, #memory_int=|v_#memory_int_450|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_42|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] and [1139] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_456| v_~q2~0.base_127))) (and |v_thread3_#t~short18#1_168| (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_53| 0)) (< v_~q2_back~0_194 v_~n2~0_134) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78| 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_59| (+ |v_thread3Thread1of1ForFork2_~t~0#1_60| |v_thread3Thread1of1ForFork2_~k~0#1_53|)) |v_thread2_#t~short13#1_181| (not (= 0 (ite (and (<= 0 v_~q2_front~0_174) (< v_~q2_front~0_174 v_~q2_back~0_193) (< v_~q2_front~0_174 v_~n2~0_134)) 1 0))) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= (+ v_~q3_back~0_171 1) v_~q3_back~0_170) (= |v_thread3Thread1of1ForFork2_~k~0#1_53| (select .cse0 (+ v_~q2~0.offset_127 (* v_~q2_front~0_174 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78| (ite |v_thread2_#t~short13#1_182| 1 0)) (= (ite |v_thread3_#t~short18#1_167| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_~s~0#1_75| (+ |v_thread2Thread1of1ForFork1_~s~0#1_76| |v_thread2Thread1of1ForFork1_~j~0#1_94|)) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_94| 0)) (= (+ (select .cse0 (+ v_~q2~0.offset_127 (* 4 v_~q2_back~0_194))) 1) |v_thread2Thread1of1ForFork1_~j~0#1_94|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|) (< v_~q3_back~0_171 v_~n3~0_118) (<= 0 v_~q3_back~0_171) (= |v_thread3Thread1of1ForFork2_~k~0#1_53| (+ (select (select |v_#memory_int_456| v_~q3~0.base_127) (+ v_~q3~0.offset_127 (* 4 v_~q3_back~0_171))) 1)) (= v_~q2_front~0_173 (+ v_~q2_front~0_174 1)) (= v_~q2_back~0_193 (+ v_~q2_back~0_194 1)))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_94|, ~n2~0=v_~n2~0_134, ~n3~0=v_~n3~0_118, ~q2~0.offset=v_~q2~0.offset_127, ~q2_front~0=v_~q2_front~0_174, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_76|, ~q3~0.offset=v_~q3~0.offset_127, ~q3_back~0=v_~q3_back~0_171, #memory_int=|v_#memory_int_456|, ~q3~0.base=v_~q3~0.base_127, ~q2~0.base=v_~q2~0.base_127, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_60|, ~q2_back~0=v_~q2_back~0_194} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_37|, ~n3~0=v_~n3~0_118, ~q2~0.offset=v_~q2~0.offset_127, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_37|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_37|, ~q3_back~0=v_~q3_back~0_170, ~q3~0.base=v_~q3~0.base_127, ~q2~0.base=v_~q2~0.base_127, ~q2_back~0=v_~q2_back~0_193, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_53|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_94|, ~n2~0=v_~n2~0_134, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_35|, ~q2_front~0=v_~q2_front~0_173, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_37|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_75|, ~q3~0.offset=v_~q3~0.offset_127, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_37|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_49|, #memory_int=|v_#memory_int_456|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_59|} AuxVars[|v_thread2_#t~short13#1_181|, |v_thread2_#t~short13#1_182|, |v_thread3_#t~short18#1_168|, |v_thread3_#t~short18#1_167|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, ~q2_back~0, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-13 01:52:27,990 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:52:27,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-13 01:52:27,991 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 547 flow [2022-12-13 01:52:27,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 01:52:27,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:27,991 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:27,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 01:52:28,196 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,SelfDestructingSolverStorable15 [2022-12-13 01:52:28,196 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -894184422, now seen corresponding path program 1 times [2022-12-13 01:52:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374935116] [2022-12-13 01:52:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:28,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:28,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374935116] [2022-12-13 01:52:28,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374935116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:28,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:52:28,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:52:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845223890] [2022-12-13 01:52:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:28,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:52:28,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:52:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:52:28,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:52:28,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 01:52:28,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:28,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:52:28,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:28,529 INFO L130 PetriNetUnfolder]: 1707/2606 cut-off events. [2022-12-13 01:52:28,530 INFO L131 PetriNetUnfolder]: For 5895/5895 co-relation queries the response was YES. [2022-12-13 01:52:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10630 conditions, 2606 events. 1707/2606 cut-off events. For 5895/5895 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11336 event pairs, 383 based on Foata normal form. 88/2196 useless extension candidates. Maximal degree in co-relation 6606. Up to 2181 conditions per place. [2022-12-13 01:52:28,543 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 73 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2022-12-13 01:52:28,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 790 flow [2022-12-13 01:52:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:52:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:52:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 01:52:28,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 01:52:28,544 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 547 flow. Second operand 3 states and 52 transitions. [2022-12-13 01:52:28,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 790 flow [2022-12-13 01:52:28,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 770 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 01:52:28,552 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 535 flow [2022-12-13 01:52:28,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2022-12-13 01:52:28,552 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2022-12-13 01:52:28,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:28,552 INFO L89 Accepts]: Start accepts. Operand has 78 places, 64 transitions, 535 flow [2022-12-13 01:52:28,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:28,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:28,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 64 transitions, 535 flow [2022-12-13 01:52:28,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 64 transitions, 535 flow [2022-12-13 01:52:28,611 INFO L130 PetriNetUnfolder]: 284/690 cut-off events. [2022-12-13 01:52:28,612 INFO L131 PetriNetUnfolder]: For 1259/1291 co-relation queries the response was YES. [2022-12-13 01:52:28,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 690 events. 284/690 cut-off events. For 1259/1291 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3818 event pairs, 19 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 1086. Up to 250 conditions per place. [2022-12-13 01:52:28,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 64 transitions, 535 flow [2022-12-13 01:52:28,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 01:52:28,626 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:52:28,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 01:52:28,626 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 535 flow [2022-12-13 01:52:28,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 01:52:28,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:28,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:28,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 01:52:28,627 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:28,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash -434563268, now seen corresponding path program 2 times [2022-12-13 01:52:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:28,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617077253] [2022-12-13 01:52:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:28,702 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 01:52:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:28,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617077253] [2022-12-13 01:52:28,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617077253] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:28,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954605835] [2022-12-13 01:52:28,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:52:28,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:28,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:28,721 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 01:52:28,724 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 01:52:28,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:52:28,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:52:28,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:52:28,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:28,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:28,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954605835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:28,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:28,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 01:52:28,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205082521] [2022-12-13 01:52:28,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:28,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:52:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:28,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:52:28,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:52:28,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:52:28,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 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 01:52:28,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:28,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:52:28,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:29,398 INFO L130 PetriNetUnfolder]: 2685/4396 cut-off events. [2022-12-13 01:52:29,398 INFO L131 PetriNetUnfolder]: For 13192/13192 co-relation queries the response was YES. [2022-12-13 01:52:29,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18997 conditions, 4396 events. 2685/4396 cut-off events. For 13192/13192 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 23713 event pairs, 1034 based on Foata normal form. 316/4050 useless extension candidates. Maximal degree in co-relation 8350. Up to 2607 conditions per place. [2022-12-13 01:52:29,418 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 104 selfloop transitions, 7 changer transitions 8/119 dead transitions. [2022-12-13 01:52:29,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 119 transitions, 1219 flow [2022-12-13 01:52:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:52:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:52:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 01:52:29,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3894736842105263 [2022-12-13 01:52:29,419 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 535 flow. Second operand 5 states and 74 transitions. [2022-12-13 01:52:29,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 119 transitions, 1219 flow [2022-12-13 01:52:29,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 119 transitions, 1204 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 01:52:29,431 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 588 flow [2022-12-13 01:52:29,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2022-12-13 01:52:29,432 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2022-12-13 01:52:29,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:29,432 INFO L89 Accepts]: Start accepts. Operand has 84 places, 68 transitions, 588 flow [2022-12-13 01:52:29,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:29,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:29,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 68 transitions, 588 flow [2022-12-13 01:52:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 68 transitions, 588 flow [2022-12-13 01:52:29,501 INFO L130 PetriNetUnfolder]: 317/880 cut-off events. [2022-12-13 01:52:29,501 INFO L131 PetriNetUnfolder]: For 1893/1925 co-relation queries the response was YES. [2022-12-13 01:52:29,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 880 events. 317/880 cut-off events. For 1893/1925 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5522 event pairs, 21 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 1880. Up to 277 conditions per place. [2022-12-13 01:52:29,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 68 transitions, 588 flow [2022-12-13 01:52:29,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-13 01:52:29,510 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:52:29,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 01:52:29,510 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 588 flow [2022-12-13 01:52:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 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 01:52:29,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:29,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:29,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 01:52:29,719 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,SelfDestructingSolverStorable17 [2022-12-13 01:52:29,719 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1327090770, now seen corresponding path program 1 times [2022-12-13 01:52:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:29,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893261983] [2022-12-13 01:52:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:30,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893261983] [2022-12-13 01:52:30,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893261983] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:30,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495907937] [2022-12-13 01:52:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:30,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:30,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:30,499 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 01:52:30,500 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 01:52:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:30,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 01:52:30,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:30,676 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 76 treesize of output 74 [2022-12-13 01:52:30,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:52:30,768 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 01:52:30,818 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 01:52:30,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2022-12-13 01:52:30,830 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 29 treesize of output 17 [2022-12-13 01:52:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:52:30,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:52:30,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495907937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:30,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:52:30,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-12-13 01:52:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893841969] [2022-12-13 01:52:30,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:30,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:52:30,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:30,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:52:30,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:52:30,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:52:30,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 588 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 01:52:30,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:30,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:52:30,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:31,415 INFO L130 PetriNetUnfolder]: 1974/3135 cut-off events. [2022-12-13 01:52:31,415 INFO L131 PetriNetUnfolder]: For 9442/9442 co-relation queries the response was YES. [2022-12-13 01:52:31,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14243 conditions, 3135 events. 1974/3135 cut-off events. For 9442/9442 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14980 event pairs, 904 based on Foata normal form. 2/2607 useless extension candidates. Maximal degree in co-relation 7331. Up to 1494 conditions per place. [2022-12-13 01:52:31,427 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 126 selfloop transitions, 11 changer transitions 15/152 dead transitions. [2022-12-13 01:52:31,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 152 transitions, 1329 flow [2022-12-13 01:52:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:52:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:52:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-12-13 01:52:31,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29210526315789476 [2022-12-13 01:52:31,429 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 588 flow. Second operand 10 states and 111 transitions. [2022-12-13 01:52:31,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 152 transitions, 1329 flow [2022-12-13 01:52:31,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 152 transitions, 1304 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 01:52:31,446 INFO L231 Difference]: Finished difference. Result has 92 places, 68 transitions, 603 flow [2022-12-13 01:52:31,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=92, PETRI_TRANSITIONS=68} [2022-12-13 01:52:31,447 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2022-12-13 01:52:31,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:31,447 INFO L89 Accepts]: Start accepts. Operand has 92 places, 68 transitions, 603 flow [2022-12-13 01:52:31,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:31,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:31,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 68 transitions, 603 flow [2022-12-13 01:52:31,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 68 transitions, 603 flow [2022-12-13 01:52:31,506 INFO L130 PetriNetUnfolder]: 314/809 cut-off events. [2022-12-13 01:52:31,507 INFO L131 PetriNetUnfolder]: For 1530/1578 co-relation queries the response was YES. [2022-12-13 01:52:31,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 809 events. 314/809 cut-off events. For 1530/1578 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4849 event pairs, 29 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 1582. Up to 276 conditions per place. [2022-12-13 01:52:31,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 68 transitions, 603 flow [2022-12-13 01:52:31,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 01:52:31,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:52:31,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 01:52:31,515 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 68 transitions, 603 flow [2022-12-13 01:52:31,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 01:52:31,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:31,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:31,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 01:52:31,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:31,718 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 122764779, now seen corresponding path program 1 times [2022-12-13 01:52:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:31,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409005832] [2022-12-13 01:52:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:31,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:33,274 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 01:52:33,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:33,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409005832] [2022-12-13 01:52:33,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409005832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:52:33,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743964364] [2022-12-13 01:52:33,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:52:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:52:33,276 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 01:52:33,278 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 01:52:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:33,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 01:52:33,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:52:33,477 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 01:52:33,634 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 01:52:33,760 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 01:52:33,931 INFO L321 Elim1Store]: treesize reduction 9, result has 83.6 percent of original size [2022-12-13 01:52:33,932 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 79 treesize of output 68 [2022-12-13 01:52:34,018 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 01:52:34,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:52:34,359 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~q3~0.offset (* c_~q3_front~0 4))) (.cse4 (* c_~q2_front~0 4)) (.cse5 (+ c_~q3~0.offset (* c_~q3_back~0 4))) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse8 (* c_~q2_back~0 4))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1238))) (let ((.cse3 (select .cse6 ~q2~0.base))) (or (forall ((~q3~0.base Int)) (let ((.cse1 (select .cse6 ~q3~0.base))) (let ((.cse0 (+ (select .cse1 .cse5) 1))) (or (<= .cse0 0) (<= (+ (select .cse1 .cse2) c_~r~0) 0) (not (<= .cse0 (select .cse3 (+ ~q2~0.offset .cse4)))))))) (< (select (select .cse6 c_~q1~0.base) .cse7) (+ (select .cse3 (+ ~q2~0.offset .cse8)) 1)))))) (forall ((v_ArrVal_1238 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1238))) (let ((.cse11 (select .cse12 ~q2~0.base))) (or (forall ((~q3~0.base Int)) (let ((.cse10 (select .cse12 ~q3~0.base))) (let ((.cse9 (+ (select .cse10 .cse5) 1))) (or (<= .cse9 0) (< 0 (+ (select .cse10 .cse2) c_~r~0 1)) (not (<= .cse9 (select .cse11 (+ ~q2~0.offset .cse4)))))))) (< (select (select .cse12 c_~q1~0.base) .cse7) (+ (select .cse11 (+ ~q2~0.offset .cse8)) 1)))))))) (not (<= 0 c_~q3_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (< (+ c_~q3_back~0 1) c_~n3~0))) is different from false [2022-12-13 01:52:35,382 INFO L321 Elim1Store]: treesize reduction 30, result has 96.1 percent of original size [2022-12-13 01:52:35,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 7922 treesize of output 7570 [2022-12-13 01:52:35,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:52:35,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6821 treesize of output 6158 [2022-12-13 01:52:35,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:52:35,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6005 treesize of output 5750 [2022-12-13 01:52:35,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:52:35,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5597 treesize of output 5342 [2022-12-13 01:52:36,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:52:36,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5189 treesize of output 4526 Received shutdown request... [2022-12-13 02:05:29,471 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 02:05:29,473 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 02:05:29,477 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:05:29,477 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:05:29,478 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:05:29,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:05:29,673 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. [2022-12-13 02:05:29,674 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 02:05:29,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 02:05:29,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 02:05:29,675 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:29,678 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:05:29,678 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:05:29,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:05:29 BasicIcfg [2022-12-13 02:05:29,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:05:29,681 INFO L158 Benchmark]: Toolchain (without parser) took 829233.79ms. Allocated memory was 170.9MB in the beginning and 893.4MB in the end (delta: 722.5MB). Free memory was 147.1MB in the beginning and 707.1MB in the end (delta: -560.0MB). Peak memory consumption was 565.2MB. Max. memory is 8.0GB. [2022-12-13 02:05:29,681 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:05:29,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.69ms. Allocated memory is still 170.9MB. Free memory was 146.9MB in the beginning and 132.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 02:05:29,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.42ms. Allocated memory is still 170.9MB. Free memory was 132.5MB in the beginning and 129.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:05:29,682 INFO L158 Benchmark]: Boogie Preprocessor took 32.10ms. Allocated memory is still 170.9MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:05:29,682 INFO L158 Benchmark]: RCFGBuilder took 691.49ms. Allocated memory is still 170.9MB. Free memory was 127.7MB in the beginning and 143.2MB in the end (delta: -15.5MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2022-12-13 02:05:29,683 INFO L158 Benchmark]: TraceAbstraction took 828183.93ms. Allocated memory was 170.9MB in the beginning and 893.4MB in the end (delta: 722.5MB). Free memory was 142.2MB in the beginning and 707.1MB in the end (delta: -564.9MB). Peak memory consumption was 560.7MB. Max. memory is 8.0GB. [2022-12-13 02:05:29,683 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.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.69ms. Allocated memory is still 170.9MB. Free memory was 146.9MB in the beginning and 132.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.42ms. Allocated memory is still 170.9MB. Free memory was 132.5MB in the beginning and 129.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.10ms. Allocated memory is still 170.9MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 691.49ms. Allocated memory is still 170.9MB. Free memory was 127.7MB in the beginning and 143.2MB in the end (delta: -15.5MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. * TraceAbstraction took 828183.93ms. Allocated memory was 170.9MB in the beginning and 893.4MB in the end (delta: 722.5MB). Free memory was 142.2MB in the beginning and 707.1MB in the end (delta: -564.9MB). Peak memory consumption was 560.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 220 PlacesBefore, 34 PlacesAfterwards, 232 TransitionsBefore, 31 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 35 ConcurrentYvCompositions, 14 ChoiceCompositions, 200 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 1198, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1108, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1108, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1222, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1108, unknown conditional: 0, unknown unconditional: 1108] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1822, Positive conditional cache size: 0, Positive unconditional cache size: 1822, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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, 31 PlacesBefore, 31 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 1.4s, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.2s, 37 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.2s, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 35 PlacesBefore, 35 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 1.7s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 38 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 4.8s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 24, Positive conditional cache size: 7, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 24, Positive conditional cache size: 7, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.2s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 13, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 61 PlacesBefore, 61 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 13, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 2.9s, 65 PlacesBefore, 64 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 13, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 4, independent: 1, independent conditional: 1, 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): 37, Positive cache size: 33, Positive conditional cache size: 16, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 8.2s, 76 PlacesBefore, 76 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.8s, 80 PlacesBefore, 78 PlacesAfterwards, 64 TransitionsBefore, 62 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 12, independent conditional: 12, 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): 45, Positive cache size: 41, Positive conditional cache size: 24, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 81 PlacesBefore, 79 PlacesAfterwards, 65 TransitionsBefore, 63 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 45, Positive conditional cache size: 28, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 78 PlacesBefore, 78 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 45, Positive conditional cache size: 28, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 84 PlacesBefore, 84 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 45, Positive conditional cache size: 28, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 92 PlacesBefore, 92 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 45, Positive conditional cache size: 28, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - TimeoutResultAtElement [Line: 144]: 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 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - TimeoutResultAtElement [Line: 143]: 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 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - TimeoutResultAtElement [Line: 142]: 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 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 261 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 828.1s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 996 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 996 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3138 IncrementalHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 0 mSDtfsCounter, 3138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=603occurred in iteration=19, InterpolantAutomatonStates: 113, 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.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 689 ConstructedInterpolants, 4 QuantifiedInterpolants, 10418 SizeOfPredicates, 83 NumberOfNonLiveVariables, 4545 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 27/48 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