./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 20:58:51,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 20:58:51,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 20:58:51,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 20:58:51,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 20:58:51,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 20:58:51,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 20:58:51,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 20:58:51,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 20:58:51,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 20:58:51,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 20:58:51,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 20:58:51,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 20:58:51,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 20:58:51,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 20:58:51,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 20:58:51,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 20:58:51,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 20:58:51,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 20:58:51,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 20:58:51,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 20:58:51,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 20:58:51,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 20:58:51,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 20:58:51,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 20:58:51,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 20:58:51,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 20:58:51,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 20:58:51,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 20:58:51,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 20:58:51,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 20:58:51,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 20:58:51,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 20:58:51,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 20:58:51,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 20:58:51,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 20:58:51,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 20:58:51,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 20:58:51,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 20:58:51,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 20:58:51,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 20:58:51,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 20:58:51,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 20:58:51,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 20:58:51,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 20:58:51,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 20:58:51,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 20:58:51,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 20:58:51,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 20:58:51,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 20:58:51,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 20:58:51,398 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 20:58:51,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 20:58:51,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 20:58:51,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 20:58:51,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 20:58:51,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 20:58:51,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 20:58:51,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 20:58:51,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 20:58:51,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 20:58:51,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 20:58:51,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 20:58:51,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 20:58:51,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 20:58:51,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 20:58:51,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 20:58:51,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:58:51,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 20:58:51,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 20:58:51,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 20:58:51,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 20:58:51,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 20:58:51,402 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 20:58:51,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 20:58:51,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 20:58:51,402 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-07-19 20:58:51,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 20:58:51,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 20:58:51,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 20:58:51,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 20:58:51,606 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 20:58:51,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-07-19 20:58:51,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2c407e9/b1dca3f076464b3797795729d21cd191/FLAGafc21d64b [2022-07-19 20:58:52,127 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 20:58:52,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-07-19 20:58:52,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2c407e9/b1dca3f076464b3797795729d21cd191/FLAGafc21d64b [2022-07-19 20:58:52,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2c407e9/b1dca3f076464b3797795729d21cd191 [2022-07-19 20:58:52,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 20:58:52,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 20:58:52,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 20:58:52,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 20:58:52,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 20:58:52,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15629c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52, skipping insertion in model container [2022-07-19 20:58:52,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 20:58:52,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 20:58:52,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-07-19 20:58:52,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-07-19 20:58:52,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:58:52,577 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 20:58:52,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-07-19 20:58:52,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-07-19 20:58:52,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:58:52,666 INFO L208 MainTranslator]: Completed translation [2022-07-19 20:58:52,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52 WrapperNode [2022-07-19 20:58:52,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 20:58:52,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 20:58:52,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 20:58:52,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 20:58:52,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,700 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-07-19 20:58:52,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 20:58:52,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 20:58:52,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 20:58:52,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 20:58:52,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 20:58:52,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 20:58:52,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 20:58:52,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 20:58:52,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (1/1) ... [2022-07-19 20:58:52,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:58:52,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:58:52,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 20:58:52,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 20:58:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-07-19 20:58:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-07-19 20:58:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-07-19 20:58:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-07-19 20:58:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 20:58:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 20:58:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 20:58:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 20:58:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-19 20:58:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 20:58:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 20:58:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 20:58:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 20:58:52,800 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 20:58:52,938 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 20:58:52,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 20:58:53,163 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 20:58:53,170 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 20:58:53,170 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 20:58:53,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:58:53 BoogieIcfgContainer [2022-07-19 20:58:53,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 20:58:53,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 20:58:53,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 20:58:53,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 20:58:53,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 08:58:52" (1/3) ... [2022-07-19 20:58:53,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b1cc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:58:53, skipping insertion in model container [2022-07-19 20:58:53,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:52" (2/3) ... [2022-07-19 20:58:53,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b1cc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:58:53, skipping insertion in model container [2022-07-19 20:58:53,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:58:53" (3/3) ... [2022-07-19 20:58:53,178 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-07-19 20:58:53,182 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 20:58:53,188 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 20:58:53,189 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 20:58:53,189 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 20:58:53,250 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-19 20:58:53,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-07-19 20:58:53,323 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2022-07-19 20:58:53,323 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 20:58:53,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 365 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-07-19 20:58:53,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-07-19 20:58:53,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-07-19 20:58:53,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 20:58:53,348 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=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bd41520, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7aed5dad [2022-07-19 20:58:53,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-19 20:58:53,355 INFO L129 PetriNetUnfolder]: 1/64 cut-off events. [2022-07-19 20:58:53,355 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 20:58:53,356 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:53,356 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:53,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 20:58:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-07-19 20:58:53,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:53,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975786293] [2022-07-19 20:58:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:53,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975786293] [2022-07-19 20:58:53,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975786293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:58:53,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:58:53,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 20:58:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623762977] [2022-07-19 20:58:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:58:53,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 20:58:53,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 20:58:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 20:58:53,542 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-07-19 20:58:53,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 219 transitions, 447 flow. Second operand has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:53,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:53,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-07-19 20:58:53,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:53,597 INFO L129 PetriNetUnfolder]: 9/210 cut-off events. [2022-07-19 20:58:53,597 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-19 20:58:53,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 210 events. 9/210 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 276 event pairs, 0 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2022-07-19 20:58:53,601 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-07-19 20:58:53,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-07-19 20:58:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 20:58:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 20:58:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-07-19 20:58:53,615 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-07-19 20:58:53,616 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-07-19 20:58:53,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-07-19 20:58:53,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:53,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-07-19 20:58:53,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.5) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:53,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:53,637 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:53,639 INFO L186 Difference]: Start difference. First operand has 213 places, 219 transitions, 447 flow. Second operand 2 states and 447 transitions. [2022-07-19 20:58:53,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-07-19 20:58:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 20:58:53,650 INFO L242 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-07-19 20:58:53,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=206, PETRI_TRANSITIONS=210} [2022-07-19 20:58:53,655 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-07-19 20:58:53,655 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-07-19 20:58:53,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:53,656 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:53,656 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:53,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 20:58:53,657 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)] === [2022-07-19 20:58:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:53,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-07-19 20:58:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:53,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036944441] [2022-07-19 20:58:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:53,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:53,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036944441] [2022-07-19 20:58:53,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036944441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:58:53,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:58:53,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 20:58:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793235938] [2022-07-19 20:58:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:58:53,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 20:58:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 20:58:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 20:58:54,002 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-07-19 20:58:54,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 210 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:54,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-07-19 20:58:54,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:54,567 INFO L129 PetriNetUnfolder]: 611/2582 cut-off events. [2022-07-19 20:58:54,568 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-07-19 20:58:54,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2582 events. 611/2582 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 20469 event pairs, 459 based on Foata normal form. 0/2410 useless extension candidates. Maximal degree in co-relation 3511. Up to 882 conditions per place. [2022-07-19 20:58:54,583 INFO L132 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-07-19 20:58:54,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-07-19 20:58:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 20:58:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 20:58:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-07-19 20:58:54,588 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-07-19 20:58:54,588 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-07-19 20:58:54,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-07-19 20:58:54,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:54,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-07-19 20:58:54,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 170.23076923076923) internal successors, (2213), 13 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,598 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,598 INFO L186 Difference]: Start difference. First operand has 206 places, 210 transitions, 424 flow. Second operand 13 states and 2213 transitions. [2022-07-19 20:58:54,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-07-19 20:58:54,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 20:58:54,602 INFO L242 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-07-19 20:58:54,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=440, PETRI_PLACES=215, PETRI_TRANSITIONS=206} [2022-07-19 20:58:54,603 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-07-19 20:58:54,603 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-07-19 20:58:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,605 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:54,605 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:54,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 20:58:54,605 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)] === [2022-07-19 20:58:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-07-19 20:58:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:54,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707760438] [2022-07-19 20:58:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:54,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:54,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707760438] [2022-07-19 20:58:54,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707760438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:58:54,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:58:54,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 20:58:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168488866] [2022-07-19 20:58:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:58:54,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:58:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:58:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 20:58:54,686 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-07-19 20:58:54,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:54,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-07-19 20:58:54,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:54,720 INFO L129 PetriNetUnfolder]: 16/307 cut-off events. [2022-07-19 20:58:54,720 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-19 20:58:54,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 307 events. 16/307 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 691 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2022-07-19 20:58:54,722 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-07-19 20:58:54,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-07-19 20:58:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:58:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 20:58:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-19 20:58:54,723 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-19 20:58:54,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-19 20:58:54,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-19 20:58:54,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:54,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-19 20:58:54,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,727 INFO L186 Difference]: Start difference. First operand has 215 places, 206 transitions, 440 flow. Second operand 3 states and 655 transitions. [2022-07-19 20:58:54,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-07-19 20:58:54,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 450 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-07-19 20:58:54,731 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-07-19 20:58:54,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-07-19 20:58:54,732 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-19 20:58:54,732 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-07-19 20:58:54,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,732 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:54,733 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:54,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 20:58:54,733 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)] === [2022-07-19 20:58:54,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash 464408434, now seen corresponding path program 1 times [2022-07-19 20:58:54,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:54,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299586635] [2022-07-19 20:58:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299586635] [2022-07-19 20:58:54,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299586635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:58:54,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:58:54,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 20:58:54,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504583467] [2022-07-19 20:58:54,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:58:54,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:58:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:54,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:58:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 20:58:54,776 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-07-19 20:58:54,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:54,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-07-19 20:58:54,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:54,810 INFO L129 PetriNetUnfolder]: 20/336 cut-off events. [2022-07-19 20:58:54,810 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 20:58:54,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 336 events. 20/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 668 event pairs, 6 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 401. Up to 24 conditions per place. [2022-07-19 20:58:54,812 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-07-19 20:58:54,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-07-19 20:58:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:58:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 20:58:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-19 20:58:54,813 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-19 20:58:54,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-19 20:58:54,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-19 20:58:54,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:54,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-19 20:58:54,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,817 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 419 flow. Second operand 3 states and 655 transitions. [2022-07-19 20:58:54,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-07-19 20:58:54,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 20:58:54,820 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-07-19 20:58:54,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-07-19 20:58:54,821 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-19 20:58:54,822 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-07-19 20:58:54,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:54,822 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:54,822 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:54,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 20:58:54,823 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)] === [2022-07-19 20:58:54,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-07-19 20:58:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062988222] [2022-07-19 20:58:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:54,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062988222] [2022-07-19 20:58:54,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062988222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:58:54,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488862237] [2022-07-19 20:58:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:54,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:58:54,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:58:54,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:58:54,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 20:58:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:55,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 20:58:55,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:58:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:55,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:58:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:55,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488862237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:58:55,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:58:55,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-19 20:58:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034656160] [2022-07-19 20:58:55,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:58:55,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 20:58:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:55,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 20:58:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:58:55,155 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:58:55,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 425 flow. Second operand has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:55,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:58:55,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:55,247 INFO L129 PetriNetUnfolder]: 30/423 cut-off events. [2022-07-19 20:58:55,247 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-19 20:58:55,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 423 events. 30/423 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 684 event pairs, 4 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 537. Up to 19 conditions per place. [2022-07-19 20:58:55,249 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-07-19 20:58:55,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-07-19 20:58:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 20:58:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 20:58:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-07-19 20:58:55,252 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-07-19 20:58:55,252 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-07-19 20:58:55,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-07-19 20:58:55,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:55,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-07-19 20:58:55,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.44444444444446) internal successors, (1939), 9 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,258 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,259 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 425 flow. Second operand 9 states and 1939 transitions. [2022-07-19 20:58:55,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-07-19 20:58:55,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 20:58:55,262 INFO L242 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-07-19 20:58:55,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=209} [2022-07-19 20:58:55,263 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-07-19 20:58:55,263 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-07-19 20:58:55,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,264 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:55,264 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:55,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 20:58:55,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:58:55,482 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)] === [2022-07-19 20:58:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:55,483 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-07-19 20:58:55,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:55,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167704732] [2022-07-19 20:58:55,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:55,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-19 20:58:55,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:55,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167704732] [2022-07-19 20:58:55,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167704732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:58:55,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:58:55,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 20:58:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473668951] [2022-07-19 20:58:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:58:55,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:58:55,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:58:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 20:58:55,560 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-07-19 20:58:55,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:55,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-07-19 20:58:55,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:55,630 INFO L129 PetriNetUnfolder]: 25/611 cut-off events. [2022-07-19 20:58:55,630 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-19 20:58:55,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 611 events. 25/611 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1290 event pairs, 3 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 725. Up to 19 conditions per place. [2022-07-19 20:58:55,632 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-07-19 20:58:55,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-07-19 20:58:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:58:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 20:58:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-07-19 20:58:55,634 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-07-19 20:58:55,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-07-19 20:58:55,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-07-19 20:58:55,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:55,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-07-19 20:58:55,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,638 INFO L186 Difference]: Start difference. First operand has 216 places, 209 transitions, 473 flow. Second operand 3 states and 645 transitions. [2022-07-19 20:58:55,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-07-19 20:58:55,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-19 20:58:55,642 INFO L242 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-07-19 20:58:55,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-07-19 20:58:55,642 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-07-19 20:58:55,643 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-07-19 20:58:55,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:55,643 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:55,643 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 20:58:55,644 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)] === [2022-07-19 20:58:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash -733343356, now seen corresponding path program 1 times [2022-07-19 20:58:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:55,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4224158] [2022-07-19 20:58:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:55,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4224158] [2022-07-19 20:58:55,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4224158] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:58:55,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790458809] [2022-07-19 20:58:55,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:55,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:58:55,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:58:55,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:58:55,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 20:58:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:55,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 20:58:55,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:58:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:56,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:58:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790458809] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:58:56,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:58:56,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-19 20:58:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779172805] [2022-07-19 20:58:56,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:58:56,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 20:58:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 20:58:56,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-19 20:58:56,176 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:58:56,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 467 flow. Second operand has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:56,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:56,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:58:56,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:56,398 INFO L129 PetriNetUnfolder]: 58/747 cut-off events. [2022-07-19 20:58:56,398 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-07-19 20:58:56,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 747 events. 58/747 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1398 event pairs, 4 based on Foata normal form. 8/736 useless extension candidates. Maximal degree in co-relation 1047. Up to 39 conditions per place. [2022-07-19 20:58:56,401 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-07-19 20:58:56,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-07-19 20:58:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 20:58:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-19 20:58:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-07-19 20:58:56,408 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-07-19 20:58:56,408 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-07-19 20:58:56,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-07-19 20:58:56,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:56,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-07-19 20:58:56,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 215.0952380952381) internal successors, (4517), 21 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:56,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:56,421 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:56,422 INFO L186 Difference]: Start difference. First operand has 217 places, 206 transitions, 467 flow. Second operand 21 states and 4517 transitions. [2022-07-19 20:58:56,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-07-19 20:58:56,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 249 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 20:58:56,426 INFO L242 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-07-19 20:58:56,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=592, PETRI_PLACES=238, PETRI_TRANSITIONS=218} [2022-07-19 20:58:56,427 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-07-19 20:58:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-07-19 20:58:56,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:56,428 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:56,428 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:56,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 20:58:56,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-19 20:58:56,646 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)] === [2022-07-19 20:58:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:56,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2142412128, now seen corresponding path program 2 times [2022-07-19 20:58:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:56,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930197821] [2022-07-19 20:58:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:56,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:56,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930197821] [2022-07-19 20:58:56,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930197821] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:58:56,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906322872] [2022-07-19 20:58:56,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 20:58:56,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:58:56,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:58:56,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:58:56,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 20:58:57,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 20:58:57,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:58:57,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 20:58:57,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:58:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:57,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:58:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:57,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906322872] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:58:57,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:58:57,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-07-19 20:58:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183796556] [2022-07-19 20:58:57,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:58:57,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 20:58:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:57,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 20:58:57,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 20:58:57,644 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:58:57,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 218 transitions, 592 flow. Second operand has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:57,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:57,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:58:57,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:58,332 INFO L129 PetriNetUnfolder]: 114/1393 cut-off events. [2022-07-19 20:58:58,332 INFO L130 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-07-19 20:58:58,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1393 events. 114/1393 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2796 event pairs, 4 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 2155. Up to 79 conditions per place. [2022-07-19 20:58:58,338 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-07-19 20:58:58,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-07-19 20:58:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-19 20:58:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-07-19 20:58:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-07-19 20:58:58,351 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-07-19 20:58:58,351 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-07-19 20:58:58,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-07-19 20:58:58,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:58,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-07-19 20:58:58,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 214.95555555555555) internal successors, (9673), 45 states have internal predecessors, (9673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:58,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:58,380 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:58,380 INFO L186 Difference]: Start difference. First operand has 238 places, 218 transitions, 592 flow. Second operand 45 states and 9673 transitions. [2022-07-19 20:58:58,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-07-19 20:58:58,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 312 transitions, 1290 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-07-19 20:58:58,391 INFO L242 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-07-19 20:58:58,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=870, PETRI_PLACES=284, PETRI_TRANSITIONS=243} [2022-07-19 20:58:58,393 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-07-19 20:58:58,394 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-07-19 20:58:58,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:58:58,395 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:58,396 INFO L200 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:58:58,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 20:58:58,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:58:58,612 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)] === [2022-07-19 20:58:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash 681727648, now seen corresponding path program 3 times [2022-07-19 20:58:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:58,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144664745] [2022-07-19 20:58:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:58:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:59,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144664745] [2022-07-19 20:58:59,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144664745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:58:59,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745863783] [2022-07-19 20:58:59,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 20:58:59,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:58:59,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:58:59,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:58:59,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 20:58:59,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 20:58:59,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:58:59,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 20:58:59,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:00,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 20:59:00,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 20:59:00,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 20:59:00,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 20:59:00,962 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 20:59:00,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-07-19 20:59:00,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 20:59:00,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 20:59:01,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 20:59:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-07-19 20:59:01,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:03,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400)) is different from false [2022-07-19 20:59:03,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 20:59:03,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-07-19 20:59:03,282 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 20:59:03,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 39 [2022-07-19 20:59:03,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 20:59:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-07-19 20:59:03,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745863783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:03,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:03,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 12] total 55 [2022-07-19 20:59:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700109256] [2022-07-19 20:59:03,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:03,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-19 20:59:03,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-19 20:59:03,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=2489, Unknown=1, NotChecked=104, Total=2970 [2022-07-19 20:59:03,933 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 231 [2022-07-19 20:59:03,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 243 transitions, 870 flow. Second operand has 55 states, 55 states have (on average 166.74545454545455) internal successors, (9171), 55 states have internal predecessors, (9171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:03,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:03,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 231 [2022-07-19 20:59:03,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:13,848 INFO L129 PetriNetUnfolder]: 2125/7558 cut-off events. [2022-07-19 20:59:13,848 INFO L130 PetriNetUnfolder]: For 2828/2828 co-relation queries the response was YES. [2022-07-19 20:59:13,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15819 conditions, 7558 events. 2125/7558 cut-off events. For 2828/2828 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 40026 event pairs, 31 based on Foata normal form. 8/7466 useless extension candidates. Maximal degree in co-relation 15796. Up to 687 conditions per place. [2022-07-19 20:59:13,884 INFO L132 encePairwiseOnDemand]: 208/231 looper letters, 871 selfloop transitions, 374 changer transitions 0/1379 dead transitions. [2022-07-19 20:59:13,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 1379 transitions, 6634 flow [2022-07-19 20:59:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-07-19 20:59:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2022-07-19 20:59:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 30535 transitions. [2022-07-19 20:59:13,916 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7184029738377564 [2022-07-19 20:59:13,917 INFO L72 ComplementDD]: Start complementDD. Operand 184 states and 30535 transitions. [2022-07-19 20:59:13,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 30535 transitions. [2022-07-19 20:59:13,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:13,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 184 states and 30535 transitions. [2022-07-19 20:59:13,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 185 states, 184 states have (on average 165.95108695652175) internal successors, (30535), 184 states have internal predecessors, (30535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:14,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 185 states, 185 states have (on average 231.0) internal successors, (42735), 185 states have internal predecessors, (42735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:14,023 INFO L81 ComplementDD]: Finished complementDD. Result has 185 states, 185 states have (on average 231.0) internal successors, (42735), 185 states have internal predecessors, (42735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:14,024 INFO L186 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 184 states and 30535 transitions. [2022-07-19 20:59:14,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 1379 transitions, 6634 flow [2022-07-19 20:59:14,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1379 transitions, 6519 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-07-19 20:59:14,049 INFO L242 Difference]: Finished difference. Result has 518 places, 648 transitions, 3386 flow [2022-07-19 20:59:14,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=184, PETRI_FLOW=3386, PETRI_PLACES=518, PETRI_TRANSITIONS=648} [2022-07-19 20:59:14,050 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 305 predicate places. [2022-07-19 20:59:14,051 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 648 transitions, 3386 flow [2022-07-19 20:59:14,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 166.74545454545455) internal successors, (9171), 55 states have internal predecessors, (9171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:14,052 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:14,053 INFO L200 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:59:14,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 20:59:14,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:14,271 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)] === [2022-07-19 20:59:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1852996793, now seen corresponding path program 1 times [2022-07-19 20:59:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:14,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067489953] [2022-07-19 20:59:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:59:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:14,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067489953] [2022-07-19 20:59:14,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067489953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:14,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556374432] [2022-07-19 20:59:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:14,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:14,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:14,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:59:14,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 20:59:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:15,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-19 20:59:15,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:59:15,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:59:16,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556374432] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:16,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:16,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-07-19 20:59:16,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908521032] [2022-07-19 20:59:16,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:16,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-19 20:59:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-19 20:59:16,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-07-19 20:59:16,781 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:59:16,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 648 transitions, 3386 flow. Second operand has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:16,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:16,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:59:16,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:22,024 INFO L129 PetriNetUnfolder]: 927/8255 cut-off events. [2022-07-19 20:59:22,024 INFO L130 PetriNetUnfolder]: For 115970/115970 co-relation queries the response was YES. [2022-07-19 20:59:22,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26432 conditions, 8255 events. 927/8255 cut-off events. For 115970/115970 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 37448 event pairs, 7 based on Foata normal form. 102/8349 useless extension candidates. Maximal degree in co-relation 26339. Up to 590 conditions per place. [2022-07-19 20:59:22,092 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 170 selfloop transitions, 162 changer transitions 0/873 dead transitions. [2022-07-19 20:59:22,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 873 transitions, 5722 flow [2022-07-19 20:59:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-07-19 20:59:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-07-19 20:59:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 21274 transitions. [2022-07-19 20:59:22,105 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9302549302549302 [2022-07-19 20:59:22,106 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 21274 transitions. [2022-07-19 20:59:22,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 21274 transitions. [2022-07-19 20:59:22,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:22,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 21274 transitions. [2022-07-19 20:59:22,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 214.88888888888889) internal successors, (21274), 99 states have internal predecessors, (21274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:22,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:22,144 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:22,144 INFO L186 Difference]: Start difference. First operand has 518 places, 648 transitions, 3386 flow. Second operand 99 states and 21274 transitions. [2022-07-19 20:59:22,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 873 transitions, 5722 flow [2022-07-19 20:59:22,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 873 transitions, 5536 flow, removed 4 selfloop flow, removed 48 redundant places. [2022-07-19 20:59:22,316 INFO L242 Difference]: Finished difference. Result has 586 places, 715 transitions, 4470 flow [2022-07-19 20:59:22,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3200, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=4470, PETRI_PLACES=586, PETRI_TRANSITIONS=715} [2022-07-19 20:59:22,317 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 373 predicate places. [2022-07-19 20:59:22,317 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 715 transitions, 4470 flow [2022-07-19 20:59:22,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:22,319 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:22,319 INFO L200 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:59:22,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 20:59:22,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 20:59:22,556 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)] === [2022-07-19 20:59:22,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2115049742, now seen corresponding path program 2 times [2022-07-19 20:59:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:22,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217045485] [2022-07-19 20:59:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:59:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217045485] [2022-07-19 20:59:24,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217045485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648939114] [2022-07-19 20:59:24,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 20:59:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:24,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:59:24,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 20:59:24,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 20:59:24,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:59:24,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-19 20:59:24,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:59:25,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:59:28,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648939114] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:28,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:28,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-07-19 20:59:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482515851] [2022-07-19 20:59:28,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-07-19 20:59:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-07-19 20:59:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-07-19 20:59:28,421 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:59:28,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 715 transitions, 4470 flow. Second operand has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:28,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:28,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:59:28,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:48,969 INFO L129 PetriNetUnfolder]: 1811/16517 cut-off events. [2022-07-19 20:59:48,969 INFO L130 PetriNetUnfolder]: For 328970/328970 co-relation queries the response was YES. [2022-07-19 20:59:49,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55497 conditions, 16517 events. 1811/16517 cut-off events. For 328970/328970 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 75751 event pairs, 7 based on Foata normal form. 204/16713 useless extension candidates. Maximal degree in co-relation 55387. Up to 1474 conditions per place. [2022-07-19 20:59:49,225 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 340 selfloop transitions, 298 changer transitions 0/1179 dead transitions. [2022-07-19 20:59:49,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1179 transitions, 9850 flow [2022-07-19 20:59:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-07-19 20:59:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-07-19 20:59:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 43187 transitions. [2022-07-19 20:59:49,246 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.930132885356766 [2022-07-19 20:59:49,247 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 43187 transitions. [2022-07-19 20:59:49,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 43187 transitions. [2022-07-19 20:59:49,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:49,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 43187 transitions. [2022-07-19 20:59:49,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 214.86069651741295) internal successors, (43187), 201 states have internal predecessors, (43187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:49,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:49,446 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:49,447 INFO L186 Difference]: Start difference. First operand has 586 places, 715 transitions, 4470 flow. Second operand 201 states and 43187 transitions. [2022-07-19 20:59:49,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1179 transitions, 9850 flow [2022-07-19 20:59:50,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 1179 transitions, 9240 flow, removed 208 selfloop flow, removed 48 redundant places. [2022-07-19 20:59:50,015 INFO L242 Difference]: Finished difference. Result has 773 places, 852 transitions, 6798 flow [2022-07-19 20:59:50,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=6798, PETRI_PLACES=773, PETRI_TRANSITIONS=852} [2022-07-19 20:59:50,016 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 560 predicate places. [2022-07-19 20:59:50,016 INFO L495 AbstractCegarLoop]: Abstraction has has 773 places, 852 transitions, 6798 flow [2022-07-19 20:59:50,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 20:59:50,019 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:50,020 INFO L200 CegarLoopForPetriNet]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:59:50,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 20:59:50,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:50,236 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)] === [2022-07-19 20:59:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1168467045, now seen corresponding path program 3 times [2022-07-19 20:59:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:50,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965060675] [2022-07-19 20:59:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:59:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:55,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965060675] [2022-07-19 20:59:55,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965060675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:55,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941676548] [2022-07-19 20:59:55,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 20:59:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:55,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:59:55,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 20:59:56,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 20:59:56,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:59:56,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-19 20:59:56,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:00:01,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 21:00:01,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:00:01,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 21:00:02,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:00:02,137 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 21:00:02,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-07-19 21:00:02,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:00:02,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 21:00:02,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 15 [2022-07-19 21:00:02,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:00:02,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 21:00:02,801 INFO L356 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-07-19 21:00:02,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 21:00:02,880 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 21:00:02,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 21:00:02,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 21:00:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 4139 proven. 1521 refuted. 0 times theorem prover too weak. 62816 trivial. 0 not checked. [2022-07-19 21:00:02,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:00:03,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-19 21:00:03,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-19 21:00:03,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-19 21:00:03,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-19 21:00:03,494 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)))))) is different from false [2022-07-19 21:00:03,501 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)))))) is different from false [2022-07-19 21:00:03,517 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2809 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)))))) is different from false [2022-07-19 21:00:03,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (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_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2815)) .cse2)) 400)))))) is different from false [2022-07-19 21:00:03,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) is different from false [2022-07-19 21:00:03,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) is different from false [2022-07-19 21:00:03,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) is different from false [2022-07-19 21:00:03,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) is different from false [2022-07-19 21:00:03,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:00:03,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 234 treesize of output 164 [2022-07-19 21:00:03,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:00:03,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 266 treesize of output 262 [2022-07-19 21:00:03,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 228 treesize of output 204 [2022-07-19 21:00:03,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:00:03,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 348 treesize of output 328 [2022-07-19 21:00:03,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 21:00:03,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:00:03,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 219 treesize of output 207 [2022-07-19 21:00:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 1687 proven. 1492 refuted. 0 times theorem prover too weak. 62816 trivial. 2481 not checked. [2022-07-19 21:00:06,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941676548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:00:06,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:00:06,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 21, 24] total 178 [2022-07-19 21:00:06,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244996951] [2022-07-19 21:00:06,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:00:06,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-07-19 21:00:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:00:06,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-07-19 21:00:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4953, Invalid=22473, Unknown=12, NotChecked=4068, Total=31506 [2022-07-19 21:00:06,418 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 231 [2022-07-19 21:00:06,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 852 transitions, 6798 flow. Second operand has 178 states, 178 states have (on average 164.41573033707866) internal successors, (29266), 178 states have internal predecessors, (29266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:00:06,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:00:06,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 231 [2022-07-19 21:00:06,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:00:07,227 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:07,668 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:08,112 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_#t~post50#1| 0) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:08,542 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-19 21:00:09,120 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-19 21:00:11,145 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-19 21:00:12,843 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-19 21:00:13,332 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:13,837 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-19 21:00:14,438 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:14,919 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:15,416 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:16,183 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:16,612 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:18,761 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:20,776 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:23,844 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:24,314 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:24,697 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:25,283 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:25,813 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:26,694 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:29,026 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:30,844 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:31,698 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:32,106 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:32,584 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:33,009 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:33,885 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:36,068 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:38,224 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:38,649 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:39,172 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:39,705 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:40,224 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:41,302 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:43,586 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:45,468 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:45,899 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:46,432 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:47,002 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 5) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:47,511 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:48,400 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:50,687 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:52,463 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:53,326 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:53,856 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 6) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:54,313 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-19 21:00:54,711 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:55,795 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-19 21:00:57,894 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-19 21:01:00,145 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-19 21:01:00,612 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-19 21:01:01,396 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 7)) is different from false [2022-07-19 21:01:01,960 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:02,366 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-19 21:01:03,414 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:05,596 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:08,095 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:08,528 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:09,206 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 8) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:09,749 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:10,156 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:11,236 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:13,467 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:15,649 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:16,617 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:17,108 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:17,540 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:18,334 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:19,159 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:21,298 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:24,128 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:24,617 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:25,275 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:25,772 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:26,653 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:27,443 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:29,669 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:32,198 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:32,641 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:33,376 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 11) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:33,994 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:34,843 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:35,538 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:37,811 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:40,082 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:41,121 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:41,639 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:42,106 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-19 21:01:43,389 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-19 21:01:44,007 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:46,097 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-19 21:01:48,897 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-19 21:01:49,327 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-19 21:01:50,118 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 13) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:50,663 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:52,160 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:52,642 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-19 21:01:54,847 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:57,542 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:58,219 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:59,045 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:59,695 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:00,945 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:01,414 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:03,648 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:06,051 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:07,177 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:07,773 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:08,225 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:09,580 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:11,748 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:12,584 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:15,404 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:15,858 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:16,718 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 16) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:17,318 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:18,728 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:21,189 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:21,949 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:24,678 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:25,142 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:26,042 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:26,739 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:28,306 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:30,609 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:31,372 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:33,164 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:34,626 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:35,170 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 18) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:35,651 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:37,183 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:39,377 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:41,043 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:43,069 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:43,579 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:44,548 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 19) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:45,159 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:46,883 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:49,219 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:50,534 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:52,682 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:53,373 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:54,385 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 20) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:55,047 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:56,459 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:58,790 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:00,130 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:01,575 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:02,910 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:03,603 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 21) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:04,104 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:05,857 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:08,079 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:10,249 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:12,244 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:12,690 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:13,671 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:14,284 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:03:16,010 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false