/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/gemcutter/NewStatesSleep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-99e0210 [2023-03-23 17:30:46,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-23 17:30:46,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-23 17:30:46,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-23 17:30:46,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-23 17:30:46,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-23 17:30:46,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-23 17:30:46,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-23 17:30:46,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-23 17:30:46,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-23 17:30:46,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-23 17:30:46,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-23 17:30:46,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-23 17:30:46,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-23 17:30:46,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-23 17:30:46,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-23 17:30:46,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-23 17:30:46,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-23 17:30:46,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-23 17:30:46,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-23 17:30:46,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-23 17:30:46,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-23 17:30:46,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-23 17:30:46,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-23 17:30:46,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-23 17:30:46,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-23 17:30:46,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-23 17:30:46,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-23 17:30:46,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-23 17:30:46,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-23 17:30:46,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-23 17:30:46,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-23 17:30:46,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-23 17:30:46,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-23 17:30:46,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-23 17:30:46,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-23 17:30:46,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-23 17:30:46,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-23 17:30:46,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-23 17:30:46,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-23 17:30:46,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-23 17:30:46,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-03-23 17:30:46,548 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-23 17:30:46,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-23 17:30:46,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-23 17:30:46,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-23 17:30:46,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-23 17:30:46,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-23 17:30:46,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * Use SBE=true [2023-03-23 17:30:46,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-23 17:30:46,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-23 17:30:46,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-23 17:30:46,551 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-23 17:30:46,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-23 17:30:46,551 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-23 17:30:46,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-23 17:30:46,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-23 17:30:46,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-23 17:30:46,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-03-23 17:30:46,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-23 17:30:46,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 17:30:46,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-23 17:30:46,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-23 17:30:46,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-23 17:30:46,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-23 17:30:46,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-23 17:30:46,555 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-03-23 17:30:46,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-03-23 17:30:46,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-23 17:30:46,555 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-03-23 17:30:46,555 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 [2023-03-23 17:30:46,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-23 17:30:46,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-23 17:30:46,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-23 17:30:46,820 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-23 17:30:46,821 INFO L275 PluginConnector]: CDTParser initialized [2023-03-23 17:30:46,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-03-23 17:30:47,989 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-23 17:30:48,208 INFO L351 CDTParser]: Found 1 translation units. [2023-03-23 17:30:48,208 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-03-23 17:30:48,221 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a17ff61f/7a23498400a94154bfccde058fff6161/FLAG18edc33dd [2023-03-23 17:30:48,234 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a17ff61f/7a23498400a94154bfccde058fff6161 [2023-03-23 17:30:48,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-23 17:30:48,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-03-23 17:30:48,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-23 17:30:48,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-23 17:30:48,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-23 17:30:48,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e4e3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48, skipping insertion in model container [2023-03-23 17:30:48,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-23 17:30:48,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-23 17:30:48,716 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-03-23 17:30:48,724 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-03-23 17:30:48,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 17:30:48,749 INFO L203 MainTranslator]: Completed pre-run [2023-03-23 17:30:48,791 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-03-23 17:30:48,794 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-03-23 17:30:48,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 17:30:48,841 INFO L208 MainTranslator]: Completed translation [2023-03-23 17:30:48,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48 WrapperNode [2023-03-23 17:30:48,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-23 17:30:48,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-03-23 17:30:48,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-03-23 17:30:48,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-03-23 17:30:48,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,886 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-03-23 17:30:48,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-03-23 17:30:48,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-23 17:30:48,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-23 17:30:48,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-23 17:30:48,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,917 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-23 17:30:48,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-23 17:30:48,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-23 17:30:48,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-23 17:30:48,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (1/1) ... [2023-03-23 17:30:48,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 17:30:48,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:48,955 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) [2023-03-23 17:30:48,957 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 [2023-03-23 17:30:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-03-23 17:30:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-03-23 17:30:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-03-23 17:30:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-23 17:30:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-23 17:30:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-23 17:30:49,003 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-03-23 17:30:49,250 INFO L236 CfgBuilder]: Building ICFG [2023-03-23 17:30:49,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-23 17:30:49,573 INFO L277 CfgBuilder]: Performing block encoding [2023-03-23 17:30:49,582 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-23 17:30:49,582 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-23 17:30:49,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 05:30:49 BoogieIcfgContainer [2023-03-23 17:30:49,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-23 17:30:49,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-23 17:30:49,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-23 17:30:49,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-23 17:30:49,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 05:30:48" (1/3) ... [2023-03-23 17:30:49,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330cc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 05:30:49, skipping insertion in model container [2023-03-23 17:30:49,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:48" (2/3) ... [2023-03-23 17:30:49,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330cc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 05:30:49, skipping insertion in model container [2023-03-23 17:30:49,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 05:30:49" (3/3) ... [2023-03-23 17:30:49,594 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-03-23 17:30:49,601 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-03-23 17:30:49,609 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-23 17:30:49,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-03-23 17:30:49,610 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-03-23 17:30:49,710 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-03-23 17:30:49,749 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 17:30:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-03-23 17:30:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:49,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-03-23 17:30:49,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-03-23 17:30:49,803 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-03-23 17:30:49,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-23 17:30:49,814 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@5db58397, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 17:30:49,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-03-23 17:30:49,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:49,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash -783037911, now seen corresponding path program 1 times [2023-03-23 17:30:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493481783] [2023-03-23 17:30:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:50,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:50,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493481783] [2023-03-23 17:30:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493481783] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-23 17:30:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227248969] [2023-03-23 17:30:50,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:50,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-23 17:30:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-23 17:30:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-23 17:30:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:50,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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) [2023-03-23 17:30:50,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-23 17:30:50,206 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:50,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -446658237, now seen corresponding path program 1 times [2023-03-23 17:30:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:50,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726816653] [2023-03-23 17:30:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726816653] [2023-03-23 17:30:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726816653] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:50,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:50,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 17:30:50,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147800032] [2023-03-23 17:30:50,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:50,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 17:30:50,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 17:30:50,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 17:30:50,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:50,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2023-03-23 17:30:50,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:50,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-23 17:30:50,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:50,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash -63200966, now seen corresponding path program 1 times [2023-03-23 17:30:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317692730] [2023-03-23 17:30:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317692730] [2023-03-23 17:30:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317692730] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 17:30:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086264856] [2023-03-23 17:30:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:50,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 17:30:50,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:50,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 17:30:50,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 17:30:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:50,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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) [2023-03-23 17:30:50,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:50,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:50,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:51,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-23 17:30:51,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:51,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1277973936, now seen corresponding path program 1 times [2023-03-23 17:30:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125253168] [2023-03-23 17:30:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125253168] [2023-03-23 17:30:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125253168] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:30:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674565819] [2023-03-23 17:30:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:51,319 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) [2023-03-23 17:30:51,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-23 17:30:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:51,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjunts are in the unsatisfiable core [2023-03-23 17:30:51,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:30:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:51,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:30:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674565819] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:30:51,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:30:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-03-23 17:30:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037242659] [2023-03-23 17:30:51,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:30:51,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-23 17:30:51,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-23 17:30:51,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-03-23 17:30:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:51,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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) [2023-03-23 17:30:51,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:51,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:51,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:51,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-23 17:30:52,011 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,SelfDestructingSolverStorable3 [2023-03-23 17:30:52,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:52,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1463355164, now seen corresponding path program 2 times [2023-03-23 17:30:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:52,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963743525] [2023-03-23 17:30:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:52,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-03-23 17:30:52,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:52,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963743525] [2023-03-23 17:30:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963743525] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:52,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 17:30:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670486926] [2023-03-23 17:30:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:52,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 17:30:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 17:30:52,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 17:30:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:52,248 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:52,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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) [2023-03-23 17:30:52,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:52,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:52,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:52,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:52,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:52,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-23 17:30:52,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:52,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1255792490, now seen corresponding path program 1 times [2023-03-23 17:30:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:52,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650402825] [2023-03-23 17:30:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650402825] [2023-03-23 17:30:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650402825] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:30:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488995218] [2023-03-23 17:30:52,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:52,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:52,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:52,665 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) [2023-03-23 17:30:52,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-23 17:30:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:52,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 8 conjunts are in the unsatisfiable core [2023-03-23 17:30:52,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:30:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:52,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:30:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488995218] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:30:53,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:30:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-03-23 17:30:53,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697987277] [2023-03-23 17:30:53,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:30:53,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-23 17:30:53,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-23 17:30:53,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-03-23 17:30:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:53,155 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:53,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.61111111111111) internal successors, (335), 18 states have internal predecessors, (335), 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) [2023-03-23 17:30:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:53,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:53,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:53,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:53,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:30:53,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-23 17:30:53,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:53,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:53,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1027634242, now seen corresponding path program 2 times [2023-03-23 17:30:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107105205] [2023-03-23 17:30:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107105205] [2023-03-23 17:30:54,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107105205] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:30:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395692503] [2023-03-23 17:30:54,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-23 17:30:54,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:54,301 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) [2023-03-23 17:30:54,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-23 17:30:54,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-03-23 17:30:54,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 17:30:54,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-23 17:30:54,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:30:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2023-03-23 17:30:54,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-23 17:30:54,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395692503] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:54,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-23 17:30:54,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2023-03-23 17:30:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327475233] [2023-03-23 17:30:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:54,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-23 17:30:54,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-23 17:30:54,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-03-23 17:30:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:54,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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) [2023-03-23 17:30:54,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:54,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:54,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:54,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:54,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:30:54,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:30:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:30:54,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-23 17:30:54,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:54,795 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:54,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash -21173911, now seen corresponding path program 1 times [2023-03-23 17:30:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:54,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583920400] [2023-03-23 17:30:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583920400] [2023-03-23 17:30:55,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583920400] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:30:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100435748] [2023-03-23 17:30:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:55,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:55,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:55,401 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) [2023-03-23 17:30:55,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-23 17:30:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:55,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 16 conjunts are in the unsatisfiable core [2023-03-23 17:30:55,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:30:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:55,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:30:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100435748] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:30:56,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:30:56,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-03-23 17:30:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505160182] [2023-03-23 17:30:56,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:30:56,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-03-23 17:30:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-03-23 17:30:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-03-23 17:30:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:56,439 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:56,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.88235294117647) internal successors, (574), 34 states have internal predecessors, (574), 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) [2023-03-23 17:30:56,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:56,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:56,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:56,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:56,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:56,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:30:56,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:30:56,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:30:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:30:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:30:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:30:57,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-23 17:30:57,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:57,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:30:57,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash 970035481, now seen corresponding path program 2 times [2023-03-23 17:30:57,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:57,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999637733] [2023-03-23 17:30:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:57,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:59,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999637733] [2023-03-23 17:30:59,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999637733] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:30:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162260377] [2023-03-23 17:30:59,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-23 17:30:59,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:30:59,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:59,140 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) [2023-03-23 17:30:59,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-23 17:30:59,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-23 17:30:59,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 17:30:59,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 32 conjunts are in the unsatisfiable core [2023-03-23 17:30:59,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:31:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:00,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:31:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:01,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162260377] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:31:01,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:31:01,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2023-03-23 17:31:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115490368] [2023-03-23 17:31:01,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:31:01,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-03-23 17:31:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:31:01,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-03-23 17:31:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-03-23 17:31:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:01,228 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:31:01,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 16.837209302325583) internal successors, (724), 43 states have internal predecessors, (724), 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) [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:01,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:31:02,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-23 17:31:02,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:02,404 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:31:02,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:31:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1046538073, now seen corresponding path program 3 times [2023-03-23 17:31:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:31:02,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81558800] [2023-03-23 17:31:02,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:31:02,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:31:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1400 proven. 37 refuted. 0 times theorem prover too weak. 4283 trivial. 0 not checked. [2023-03-23 17:31:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:31:07,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81558800] [2023-03-23 17:31:07,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81558800] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:31:07,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465739345] [2023-03-23 17:31:07,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-23 17:31:07,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:31:07,852 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) [2023-03-23 17:31:07,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-03-23 17:31:08,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-23 17:31:08,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 17:31:08,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 54 conjunts are in the unsatisfiable core [2023-03-23 17:31:08,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:31:11,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-23 17:31:11,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:11,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:31:11,378 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:31:11,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:31:11,438 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 19 treesize of output 18 [2023-03-23 17:31:11,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-03-23 17:31:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 588 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 0 not checked. [2023-03-23 17:31:11,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:31:11,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:11,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2023-03-23 17:31:11,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:11,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 79 [2023-03-23 17:31:11,966 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 59 treesize of output 51 [2023-03-23 17:31:11,979 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 7 treesize of output 3 [2023-03-23 17:31:12,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:12,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2023-03-23 17:31:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 588 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 0 not checked. [2023-03-23 17:31:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465739345] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:31:12,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:31:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 41 [2023-03-23 17:31:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955605736] [2023-03-23 17:31:12,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:31:12,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-03-23 17:31:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:31:12,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-03-23 17:31:12,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1437, Unknown=1, NotChecked=0, Total=1640 [2023-03-23 17:31:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:12,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:31:12,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.658536585365853) internal successors, (478), 41 states have internal predecessors, (478), 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) [2023-03-23 17:31:12,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:12,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:31:12,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:31:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-23 17:31:13,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-23 17:31:14,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:14,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:31:14,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:31:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 724881999, now seen corresponding path program 1 times [2023-03-23 17:31:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:31:14,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770701765] [2023-03-23 17:31:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:31:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:31:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 5749 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:31:16,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770701765] [2023-03-23 17:31:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770701765] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:31:16,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931401112] [2023-03-23 17:31:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:31:16,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:31:16,938 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) [2023-03-23 17:31:16,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-03-23 17:31:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:17,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 42 conjunts are in the unsatisfiable core [2023-03-23 17:31:17,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:31:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 6281 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:18,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-23 17:31:18,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931401112] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:31:18,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-23 17:31:18,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-03-23 17:31:18,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504803775] [2023-03-23 17:31:18,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:31:18,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-03-23 17:31:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:31:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-03-23 17:31:18,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-03-23 17:31:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:18,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:31:18,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 18.41860465116279) internal successors, (792), 43 states have internal predecessors, (792), 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) [2023-03-23 17:31:18,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:18,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-03-23 17:31:18,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:31:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-23 17:31:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 17:31:19,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-03-23 17:31:19,350 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,SelfDestructingSolverStorable10 [2023-03-23 17:31:19,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:31:19,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:31:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1231800167, now seen corresponding path program 2 times [2023-03-23 17:31:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:31:19,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031060002] [2023-03-23 17:31:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:31:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:31:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3419 proven. 182 refuted. 0 times theorem prover too weak. 2099 trivial. 0 not checked. [2023-03-23 17:31:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:31:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031060002] [2023-03-23 17:31:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031060002] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:31:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417238707] [2023-03-23 17:31:23,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-23 17:31:23,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:31:23,832 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) [2023-03-23 17:31:23,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-03-23 17:31:24,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-23 17:31:24,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 17:31:24,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 78 conjunts are in the unsatisfiable core [2023-03-23 17:31:24,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:31:25,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-23 17:31:25,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:25,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:31:25,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:25,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-03-23 17:31:26,044 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 19 treesize of output 18 [2023-03-23 17:31:26,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-23 17:31:26,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:26,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:31:26,429 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 19 treesize of output 18 [2023-03-23 17:31:26,458 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 19 treesize of output 18 [2023-03-23 17:31:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3287 proven. 201 refuted. 0 times theorem prover too weak. 2212 trivial. 0 not checked. [2023-03-23 17:31:26,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:31:26,728 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1))))) is different from false [2023-03-23 17:31:26,757 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20))) is different from false [2023-03-23 17:31:26,763 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20))) is different from false [2023-03-23 17:31:26,775 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1))))) is different from false [2023-03-23 17:31:26,803 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2073) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20))) is different from false [2023-03-23 17:31:26,827 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2071 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2071)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2073) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1))))) is different from false [2023-03-23 17:31:26,844 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2071 Int)) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2071))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2073) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) v_ArrVal_2079)) .cse3)) 20)))))) is different from false [2023-03-23 17:31:26,865 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2071))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2073) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20)) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|)))) is different from false [2023-03-23 17:31:27,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2073 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2070))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2071))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2073) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|))))) is different from false [2023-03-23 17:31:27,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:27,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 144 [2023-03-23 17:31:27,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:27,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 222 [2023-03-23 17:31:27,075 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 97 treesize of output 85 [2023-03-23 17:31:27,084 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 11 treesize of output 7 [2023-03-23 17:31:27,108 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 8 treesize of output 4 [2023-03-23 17:31:27,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:27,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 84 [2023-03-23 17:31:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3099 proven. 167 refuted. 0 times theorem prover too weak. 2239 trivial. 195 not checked. [2023-03-23 17:31:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417238707] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:31:27,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:31:27,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 57 [2023-03-23 17:31:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798572268] [2023-03-23 17:31:27,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:31:27,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-03-23 17:31:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:31:27,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-03-23 17:31:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1926, Unknown=9, NotChecked=900, Total=3192 [2023-03-23 17:31:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:27,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:31:27,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 10.982456140350877) internal successors, (626), 57 states have internal predecessors, (626), 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) [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-03-23 17:31:27,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-03-23 17:31:27,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 17:31:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-03-23 17:31:29,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-03-23 17:31:29,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:29,950 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:31:29,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:31:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash -590754094, now seen corresponding path program 3 times [2023-03-23 17:31:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:31:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077371477] [2023-03-23 17:31:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:31:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:31:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3719 proven. 200 refuted. 0 times theorem prover too weak. 2071 trivial. 0 not checked. [2023-03-23 17:31:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:31:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077371477] [2023-03-23 17:31:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077371477] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:31:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982002021] [2023-03-23 17:31:39,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-23 17:31:39,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:39,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:31:39,049 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) [2023-03-23 17:31:39,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-03-23 17:33:02,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-03-23 17:33:02,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 17:33:02,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 139 conjunts are in the unsatisfiable core [2023-03-23 17:33:02,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:33:04,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-23 17:33:04,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:33:04,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:33:04,428 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:33:04,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:33:04,495 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 19 treesize of output 18 [2023-03-23 17:33:04,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-03-23 17:33:04,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:33:04,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:33:05,024 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:33:05,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2023-03-23 17:33:05,097 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 19 treesize of output 18 [2023-03-23 17:33:05,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-03-23 17:33:05,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:33:05,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:33:05,610 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:33:05,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2023-03-23 17:33:05,697 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 19 treesize of output 18 [2023-03-23 17:33:05,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-03-23 17:33:05,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:33:05,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:33:06,150 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:33:06,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-03-23 17:33:06,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 19 treesize of output 18 [2023-03-23 17:33:06,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-03-23 17:33:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3237 proven. 482 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2023-03-23 17:33:06,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:33:06,420 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20))) is different from false [2023-03-23 17:33:06,450 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1))))) is different from false [2023-03-23 17:33:06,530 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20))) is different from false [2023-03-23 17:33:06,538 WARN L839 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20)))) is different from false [2023-03-23 17:33:06,597 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2482 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1)) 20))) (= .cse4 20)))) is different from false [2023-03-23 17:33:06,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2475)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1)) 20)) (= .cse4 20))))) is different from false [2023-03-23 17:33:06,630 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2475)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20)) (= .cse4 20)))))) is different from false [2023-03-23 17:33:06,656 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2475)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1)) 20)) (= .cse4 20)))))) is different from false [2023-03-23 17:33:07,049 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2)))))))) is different from false [2023-03-23 17:33:07,067 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2023-03-23 17:33:07,086 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2)))))))) (= .cse8 20)))) is different from false [2023-03-23 17:33:07,125 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2471) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2) 20))))))) (= .cse8 20)))) is different from false [2023-03-23 17:33:07,177 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2469)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2471) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_2475)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1) 20)) (= .cse4 20) (= 20 .cse5)))))))) is different from false [2023-03-23 17:33:07,198 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2469)))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2471) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse3))))))))))) is different from false [2023-03-23 17:33:07,238 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2469)))) (let ((.cse1 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2471) .cse8 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse0 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2482)) .cse3) 20)))))))))) is different from false [2023-03-23 17:33:07,676 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_2469)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_2471) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2478) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse3) 20)))))))))) is different from false [2023-03-23 17:33:07,696 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2471) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2) 20)) (= 20 .cse6))))))))) is different from false [2023-03-23 17:33:07,956 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse12 .cse13))) (or (= .cse0 20) (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_2469)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_2471) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2478) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse3) 20)) (= .cse7 20)))))))))))) is different from false [2023-03-23 17:33:08,022 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse11 .cse12))) (or (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2463) .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) v_ArrVal_2469)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2471) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2478) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1) 20)) (= 20 .cse6) (= 20 .cse5))))))))) (= .cse13 20)))) is different from false [2023-03-23 17:33:08,121 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2461)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse12 .cse13))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2463) .cse13 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2471) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse0 (select .cse6 .cse4))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2478) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_2482)) .cse4) 20)))))))))))) is different from false [2023-03-23 17:33:08,160 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230|) (forall ((v_ArrVal_2461 Int) (v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse14 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2461))) (let ((.cse2 (select .cse14 .cse1))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2463) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse12 .cse5))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2471) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse7 (let ((.cse10 (select .cse6 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse5)) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse9 (select .cse7 .cse5))) (or (= .cse2 20) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2478) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse5) 20)) (= 20 .cse9)))))))))))))) is different from false [2023-03-23 17:33:08,230 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse14 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2461)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (select .cse14 .cse9))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2463) .cse9 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) v_ArrVal_2469)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse12 .cse1))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2471) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse3 (let ((.cse10 (select .cse2 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2478) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1) 20)) (= 20 .cse5) (= .cse6 20) (= .cse7 20) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230|)))))))))))) is different from false [2023-03-23 17:33:10,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:33:10,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 5745 treesize of output 3875 [2023-03-23 17:33:10,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:33:10,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3108 treesize of output 3032 [2023-03-23 17:33:10,723 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 601 treesize of output 589 [2023-03-23 17:33:10,738 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 36 treesize of output 28 [2023-03-23 17:33:10,752 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 32 treesize of output 20 [2023-03-23 17:33:10,766 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 32 treesize of output 20 [2023-03-23 17:33:10,795 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 7 treesize of output 3 [2023-03-23 17:33:10,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:33:10,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 573 treesize of output 509 [2023-03-23 17:33:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 2139 proven. 634 refuted. 201 times theorem prover too weak. 2271 trivial. 745 not checked. [2023-03-23 17:33:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982002021] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:33:17,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:33:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 46] total 105 [2023-03-23 17:33:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120051046] [2023-03-23 17:33:17,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:33:17,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2023-03-23 17:33:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:33:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2023-03-23 17:33:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1263, Invalid=5515, Unknown=116, NotChecked=4026, Total=10920 [2023-03-23 17:33:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:33:17,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:33:17,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 7.780952380952381) internal successors, (817), 105 states have internal predecessors, (817), 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) [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-03-23 17:33:17,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:33:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:33:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:33:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:33:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 17:33:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:33:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 17:33:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 17:33:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 17:33:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 17:33:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-23 17:33:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 17:33:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-03-23 17:33:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 17:33:30,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-03-23 17:33:31,101 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,SelfDestructingSolverStorable12 [2023-03-23 17:33:31,101 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-03-23 17:33:31,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:33:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 910595484, now seen corresponding path program 4 times [2023-03-23 17:33:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:33:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277693055] [2023-03-23 17:33:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:33:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:33:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:33:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 4323 proven. 960 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2023-03-23 17:33:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:33:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277693055] [2023-03-23 17:33:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277693055] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:33:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245818961] [2023-03-23 17:33:50,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-23 17:33:50,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:33:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:33:50,712 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) [2023-03-23 17:33:50,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-03-23 17:34:02,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-23 17:34:02,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 17:34:02,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 169 conjunts are in the unsatisfiable core [2023-03-23 17:34:02,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:34:02,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-23 17:34:02,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:02,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:02,776 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:02,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:02,818 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 19 treesize of output 18 [2023-03-23 17:34:02,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 17:34:03,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:03,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:03,374 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:03,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:03,436 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 19 treesize of output 18 [2023-03-23 17:34:03,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 17:34:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:03,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:03,937 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:03,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:03,978 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 19 treesize of output 18 [2023-03-23 17:34:04,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 17:34:04,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:04,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:04,522 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:04,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:04,575 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 19 treesize of output 18 [2023-03-23 17:34:04,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 17:34:04,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:04,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:05,099 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:05,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:05,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 19 treesize of output 18 [2023-03-23 17:34:05,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 17:34:05,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:05,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:05,719 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:05,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:05,774 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 19 treesize of output 18 [2023-03-23 17:34:05,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 17:34:06,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:06,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:06,255 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:06,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:06,287 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 19 treesize of output 18 [2023-03-23 17:34:06,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 17:34:06,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:34:06,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 17:34:06,663 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 17:34:06,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 17:34:06,683 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 19 treesize of output 18 [2023-03-23 17:34:06,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-03-23 17:34:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3321 proven. 930 refuted. 0 times theorem prover too weak. 1911 trivial. 0 not checked. [2023-03-23 17:34:06,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:35:36,474 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2907 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2901)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2905) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2912)))))))) is different from false [2023-03-23 17:36:05,747 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2912) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2905) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2897) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|))))))))) is different from false [2023-03-23 17:36:19,054 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2894)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2896) .cse5 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2912) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2897) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20)))))))))) is different from false [2023-03-23 17:36:19,136 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse0 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2894))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2897) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2912) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2905) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|)))))))))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|)))) is different from false [2023-03-23 17:36:19,256 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2894)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2905) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2912) (< (+ (select .cse9 .cse3) 1) v_ArrVal_2897))))))))))) is different from false [2023-03-23 17:36:55,083 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2905) (< (+ 1 (select .cse3 .cse1)) v_ArrVal_2912) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2891) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897)))))))))))) is different from false [2023-03-23 17:36:55,148 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2905) (< (+ 1 (select .cse3 .cse1)) v_ArrVal_2912) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2891) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897)))))))))))) is different from false [2023-03-23 17:37:05,517 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2886)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2888) .cse5 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2912) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2891) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2905) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|))))))))))))) is different from false [2023-03-23 17:37:05,614 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse9 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2886))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse4 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse10 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_2897) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2912) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2891) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2905)))))))))))))))) is different from false [2023-03-23 17:37:05,782 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2886)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse4 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse9 .cse11 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2891) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2905) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2912) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2897) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20)))))))))))))) is different from false [2023-03-23 17:37:31,082 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2897) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2912))))))))))))))) is different from false [2023-03-23 17:37:31,535 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2897) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2884) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2891) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2905) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|))))))))))))))) is different from false [2023-03-23 17:37:31,627 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2897) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2884) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2891) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2905) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|))))))))))))))) is different from false [2023-03-23 17:37:31,719 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse12 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse8 (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2897) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2884) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2912) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2891) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2905) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|)))))))))))))))) is different from false [2023-03-23 17:37:39,416 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2879)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2882) .cse5 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse0 (select .cse15 |c_~#queue~0.base|))) (let ((.cse10 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse8 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2912) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2884) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2897) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2891) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2905)))))))))))))))) is different from false [2023-03-23 17:37:39,575 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2879))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse10 (store (store .cse14 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_2891) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2897) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2905) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2912))))))))))))))))))) is different from false [2023-03-23 17:37:39,846 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2879)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2882) .cse6 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse0 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse2 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (+ (select .cse7 .cse6) 1) v_ArrVal_2884) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2891) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2897) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2905))))))))))))))))) is different from false [2023-03-23 17:38:44,936 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2875) .cse5 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse10 (select .cse18 |c_~#queue~0.base|))) (let ((.cse0 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse0 .cse12 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse7 (select .cse17 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse3 .cse12 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse2 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse14 .cse12 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse9 (select .cse15 |c_~#queue~0.base|))) (let ((.cse13 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse11 (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse12 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2884) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2877) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2912) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2897))))))))))))))))))) is different from false [2023-03-23 17:38:45,409 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2873)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2875) .cse6 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse10 (select .cse18 |c_~#queue~0.base|))) (let ((.cse7 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse14 (select .cse17 |c_~#queue~0.base|))) (let ((.cse0 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse11 (select .cse15 |c_~#queue~0.base|))) (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse3 (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse12 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2912) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2877) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2905) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|))))))))))))))))))) is different from false [2023-03-23 17:38:50,168 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2873)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2875) .cse5 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse13 (select .cse19 |c_~#queue~0.base|))) (let ((.cse14 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse14 .cse2 v_ArrVal_2882) .cse3 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse12 (select .cse18 |c_~#queue~0.base|))) (let ((.cse8 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse9 (select .cse17 |c_~#queue~0.base|))) (let ((.cse15 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse0 (store (store .cse16 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse11 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2877) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2905) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2891) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2912) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse14 .cse3) 1) v_ArrVal_2884) (< (+ (select .cse15 .cse3) 1) v_ArrVal_2897)))))))))))))))))))) is different from false [2023-03-23 17:39:29,720 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse19 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse11 (select .cse19 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_2873)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2875) .cse1 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse8 (select .cse18 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse7 (select .cse17 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse0 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse13 (select .cse15 |c_~#queue~0.base|))) (let ((.cse12 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse2 (store (store .cse15 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2877) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2905) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2897))))))))))))))))))))) is different from false [2023-03-23 17:39:31,500 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2869 Int) (v_ArrVal_2901 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2869)) |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse14 (select .cse19 |c_~#queue~0.base|))) (let ((.cse6 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_2873)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_2875) .cse1 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse13 (select .cse18 |c_~#queue~0.base|))) (let ((.cse11 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse3 (select .cse17 |c_~#queue~0.base|))) (let ((.cse10 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse12 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse4 (store (store .cse15 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2912) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2877) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2897) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2869) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|))))))))))))))))))))) is different from false Received shutdown request... [2023-03-23 17:39:37,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-03-23 17:39:37,467 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 [2023-03-23 17:39:37,468 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-03-23 17:39:38,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-03-23 17:39:38,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-03-23 17:39:38,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-03-23 17:39:38,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-03-23 17:39:38,555 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 174 known predicates. [2023-03-23 17:39:38,556 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-03-23 17:39:38,556 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-03-23 17:39:38,557 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-03-23 17:39:38,557 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-03-23 17:39:38,560 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1] [2023-03-23 17:39:38,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-03-23 17:39:38,581 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-23 17:39:38,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 05:39:38 BasicIcfg [2023-03-23 17:39:38,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-23 17:39:38,583 INFO L158 Benchmark]: Toolchain (without parser) took 530345.92ms. Allocated memory was 288.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 229.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 263.6MB. Max. memory is 8.0GB. [2023-03-23 17:39:38,583 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-23 17:39:38,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.49ms. Allocated memory is still 288.4MB. Free memory was 229.9MB in the beginning and 199.9MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-03-23 17:39:38,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.29ms. Allocated memory is still 288.4MB. Free memory was 199.9MB in the beginning and 197.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-23 17:39:38,584 INFO L158 Benchmark]: Boogie Preprocessor took 33.72ms. Allocated memory is still 288.4MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-23 17:39:38,584 INFO L158 Benchmark]: RCFGBuilder took 664.35ms. Allocated memory is still 288.4MB. Free memory was 195.0MB in the beginning and 241.6MB in the end (delta: -46.6MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2023-03-23 17:39:38,584 INFO L158 Benchmark]: TraceAbstraction took 528994.78ms. Allocated memory was 288.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 240.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 272.9MB. Max. memory is 8.0GB. [2023-03-23 17:39:38,585 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.15ms. Allocated memory is still 189.8MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 603.49ms. Allocated memory is still 288.4MB. Free memory was 229.9MB in the beginning and 199.9MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.29ms. Allocated memory is still 288.4MB. Free memory was 199.9MB in the beginning and 197.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.72ms. Allocated memory is still 288.4MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 664.35ms. Allocated memory is still 288.4MB. Free memory was 195.0MB in the beginning and 241.6MB in the end (delta: -46.6MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * TraceAbstraction took 528994.78ms. Allocated memory was 288.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 240.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 272.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7483, independent: 6769, independent conditional: 6769, independent unconditional: 0, dependent: 714, dependent conditional: 714, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6781, independent: 6769, independent conditional: 6769, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6781, independent: 6769, independent conditional: 6769, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6803, independent: 6769, independent conditional: 0, independent unconditional: 6769, dependent: 34, dependent conditional: 22, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6803, independent: 6769, independent conditional: 0, independent unconditional: 6769, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6803, independent: 6769, independent conditional: 0, independent unconditional: 6769, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 398, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 398, independent: 392, independent conditional: 0, independent unconditional: 392, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 43, dependent conditional: 6, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6803, independent: 6375, independent conditional: 0, independent unconditional: 6375, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 398, unknown conditional: 2, unknown unconditional: 396] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 394, Positive conditional cache size: 0, Positive unconditional cache size: 394, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 702 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 174 known predicates. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 174 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 174 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 174 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 528.8s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 19.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 322, 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.6s SsaConstructionTime, 84.9s SatisfiabilityAnalysisTime, 52.8s InterpolantComputationTime, 9816 NumberOfCodeBlocks, 8704 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 13322 ConstructedInterpolants, 196 QuantifiedInterpolants, 178844 SizeOfPredicates, 178 NumberOfNonLiveVariables, 7805 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 61078/77847 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