./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_ok_longest.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_longest.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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 20:58:56,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 20:58:56,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 20:58:56,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 20:58:56,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 20:58:56,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 20:58:56,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 20:58:56,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 20:58:56,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 20:58:56,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 20:58:56,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 20:58:56,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 20:58:56,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 20:58:56,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 20:58:56,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 20:58:56,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 20:58:56,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 20:58:56,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 20:58:56,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 20:58:56,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 20:58:56,383 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 20:58:56,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 20:58:56,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 20:58:56,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 20:58:56,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 20:58:56,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 20:58:56,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 20:58:56,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 20:58:56,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 20:58:56,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 20:58:56,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 20:58:56,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 20:58:56,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 20:58:56,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 20:58:56,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 20:58:56,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 20:58:56,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 20:58:56,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 20:58:56,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 20:58:56,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 20:58:56,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 20:58:56,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 20:58:56,409 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:56,444 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 20:58:56,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 20:58:56,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 20:58:56,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 20:58:56,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 20:58:56,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 20:58:56,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 20:58:56,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 20:58:56,447 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 20:58:56,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 20:58:56,448 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 20:58:56,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 20:58:56,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 20:58:56,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 20:58:56,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 20:58:56,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 20:58:56,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 20:58:56,450 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 20:58:56,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 20:58:56,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 20:58:56,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 20:58:56,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 20:58:56,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 20:58:56,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 20:58:56,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:58:56,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 20:58:56,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 20:58:56,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 20:58:56,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 20:58:56,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 20:58:56,454 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 20:58:56,454 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 20:58:56,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 20:58:56,454 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-07-19 20:58:56,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 20:58:56,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 20:58:56,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 20:58:56,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 20:58:56,742 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 20:58:56,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-07-19 20:58:56,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c6fe29b/2573f1e09cc64a3c9f26b2cc4afe9a51/FLAG2243eb19e [2022-07-19 20:58:57,403 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 20:58:57,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-07-19 20:58:57,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c6fe29b/2573f1e09cc64a3c9f26b2cc4afe9a51/FLAG2243eb19e [2022-07-19 20:58:57,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c6fe29b/2573f1e09cc64a3c9f26b2cc4afe9a51 [2022-07-19 20:58:57,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 20:58:57,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 20:58:57,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 20:58:57,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 20:58:57,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 20:58:57,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:58:57" (1/1) ... [2022-07-19 20:58:57,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598ca592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:57, skipping insertion in model container [2022-07-19 20:58:57,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:58:57" (1/1) ... [2022-07-19 20:58:57,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 20:58:57,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 20:58:58,208 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_longest.i[43280,43293] [2022-07-19 20:58:58,216 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_longest.i[43553,43566] [2022-07-19 20:58:58,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:58:58,228 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 20:58:58,263 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_longest.i[43280,43293] [2022-07-19 20:58:58,266 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_longest.i[43553,43566] [2022-07-19 20:58:58,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:58:58,334 INFO L208 MainTranslator]: Completed translation [2022-07-19 20:58:58,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:58 WrapperNode [2022-07-19 20:58:58,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 20:58:58,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 20:58:58,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 20:58:58,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 20:58:58,343 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:58" (1/1) ... [2022-07-19 20:58:58,360 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:58" (1/1) ... [2022-07-19 20:58:58,384 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-07-19 20:58:58,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 20:58:58,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 20:58:58,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 20:58:58,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 20:58:58,393 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:58" (1/1) ... [2022-07-19 20:58:58,394 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:58" (1/1) ... [2022-07-19 20:58:58,398 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:58" (1/1) ... [2022-07-19 20:58:58,398 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:58" (1/1) ... [2022-07-19 20:58:58,406 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:58" (1/1) ... [2022-07-19 20:58:58,410 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:58" (1/1) ... [2022-07-19 20:58:58,412 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:58" (1/1) ... [2022-07-19 20:58:58,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 20:58:58,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 20:58:58,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 20:58:58,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 20:58:58,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:58" (1/1) ... [2022-07-19 20:58:58,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:58:58,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:58:58,456 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:58,458 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:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-07-19 20:58:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-07-19 20:58:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-07-19 20:58:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-07-19 20:58:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 20:58:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 20:58:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 20:58:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 20:58:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-19 20:58:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 20:58:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 20:58:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 20:58:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 20:58:58,496 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:58,679 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 20:58:58,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 20:58:59,004 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 20:58:59,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 20:58:59,017 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 20:58:59,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:58:59 BoogieIcfgContainer [2022-07-19 20:58:59,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 20:58:59,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 20:58:59,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 20:58:59,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 20:58:59,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 08:58:57" (1/3) ... [2022-07-19 20:58:59,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a561324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:58:59, skipping insertion in model container [2022-07-19 20:58:59,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:58:58" (2/3) ... [2022-07-19 20:58:59,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a561324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:58:59, skipping insertion in model container [2022-07-19 20:58:59,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:58:59" (3/3) ... [2022-07-19 20:58:59,027 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-07-19 20:58:59,032 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 20:58:59,040 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 20:58:59,040 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 20:58:59,041 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 20:58:59,143 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-19 20:58:59,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-07-19 20:58:59,294 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2022-07-19 20:58:59,294 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 20:58:59,301 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:59,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-07-19 20:58:59,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-07-19 20:58:59,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 20:58:59,336 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@1d624eb0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b3712d6 [2022-07-19 20:58:59,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-19 20:58:59,364 INFO L129 PetriNetUnfolder]: 1/64 cut-off events. [2022-07-19 20:58:59,365 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 20:58:59,365 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:59,366 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:59,366 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:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-07-19 20:58:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:59,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316071511] [2022-07-19 20:58:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:58:59,603 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:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:58:59,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316071511] [2022-07-19 20:58:59,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316071511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:58:59,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:58:59,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 20:58:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345769075] [2022-07-19 20:58:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:58:59,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 20:58:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:58:59,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 20:58:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 20:58:59,650 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-07-19 20:58:59,657 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:59,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:58:59,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-07-19 20:58:59,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:58:59,722 INFO L129 PetriNetUnfolder]: 9/210 cut-off events. [2022-07-19 20:58:59,723 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-19 20:58:59,727 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:59,729 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-07-19 20:58:59,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-07-19 20:58:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 20:58:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 20:58:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-07-19 20:58:59,752 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-07-19 20:58:59,753 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-07-19 20:58:59,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-07-19 20:58:59,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:58:59,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-07-19 20:58:59,764 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:59,771 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:59,772 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:59,774 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:59,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-07-19 20:58:59,778 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:59,784 INFO L242 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-07-19 20:58:59,786 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:59,794 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-07-19 20:58:59,795 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-07-19 20:58:59,795 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:59,796 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:58:59,796 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:59,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 20:58:59,797 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:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:58:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-07-19 20:58:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:58:59,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635488071] [2022-07-19 20:58:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:58:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:58:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:00,186 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:59:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:00,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635488071] [2022-07-19 20:59:00,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635488071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:59:00,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:59:00,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 20:59:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602214415] [2022-07-19 20:59:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:59:00,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 20:59:00,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 20:59:00,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 20:59:00,197 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-07-19 20:59:00,200 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:59:00,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:00,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-07-19 20:59:00,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:00,968 INFO L129 PetriNetUnfolder]: 611/2582 cut-off events. [2022-07-19 20:59:00,969 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-07-19 20:59:00,976 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:59:00,985 INFO L132 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-07-19 20:59:00,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-07-19 20:59:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 20:59:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 20:59:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-07-19 20:59:00,990 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-07-19 20:59:00,991 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-07-19 20:59:00,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-07-19 20:59:00,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:00,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-07-19 20:59:00,996 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:59:01,003 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:59:01,004 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:59:01,005 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:59:01,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-07-19 20:59:01,006 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:59:01,009 INFO L242 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-07-19 20:59:01,010 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:59:01,011 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-07-19 20:59:01,011 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-07-19 20:59:01,012 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:59:01,012 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:01,013 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:59:01,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 20:59:01,013 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:59:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-07-19 20:59:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:01,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879262146] [2022-07-19 20:59:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:01,091 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:59:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:01,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879262146] [2022-07-19 20:59:01,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879262146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:59:01,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:59:01,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 20:59:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297223699] [2022-07-19 20:59:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:59:01,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:59:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:59:01,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 20:59:01,094 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-07-19 20:59:01,095 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:59:01,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:01,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-07-19 20:59:01,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:01,153 INFO L129 PetriNetUnfolder]: 16/307 cut-off events. [2022-07-19 20:59:01,153 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-19 20:59:01,154 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:59:01,155 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-07-19 20:59:01,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-07-19 20:59:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:59:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 20:59:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-19 20:59:01,157 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-19 20:59:01,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-19 20:59:01,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-19 20:59:01,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:01,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-19 20:59:01,160 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:59:01,161 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:59:01,162 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:59:01,162 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:59:01,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-07-19 20:59:01,164 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:59:01,166 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-07-19 20:59:01,167 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:59:01,167 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-19 20:59:01,168 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-07-19 20:59:01,168 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:59:01,168 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:01,169 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:59:01,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 20:59:01,169 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:59:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash 464408434, now seen corresponding path program 1 times [2022-07-19 20:59:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:01,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668184276] [2022-07-19 20:59:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:01,217 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:59:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668184276] [2022-07-19 20:59:01,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668184276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:59:01,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:59:01,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 20:59:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392916534] [2022-07-19 20:59:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:59:01,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:59:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:59:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 20:59:01,221 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-07-19 20:59:01,222 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:59:01,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:01,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-07-19 20:59:01,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:01,265 INFO L129 PetriNetUnfolder]: 20/336 cut-off events. [2022-07-19 20:59:01,265 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 20:59:01,266 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:59:01,267 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-07-19 20:59:01,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-07-19 20:59:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:59:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 20:59:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-19 20:59:01,269 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-19 20:59:01,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-19 20:59:01,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-19 20:59:01,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:01,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-19 20:59:01,272 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:59:01,273 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:59:01,274 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:59:01,274 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:59:01,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-07-19 20:59:01,276 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:59:01,278 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-07-19 20:59:01,279 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:59:01,281 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-19 20:59:01,281 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-07-19 20:59:01,282 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:59:01,282 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:01,282 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:59:01,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 20:59:01,283 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:59:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-07-19 20:59:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:01,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097050206] [2022-07-19 20:59:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:01,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:01,426 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:59:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:01,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097050206] [2022-07-19 20:59:01,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097050206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:01,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675622030] [2022-07-19 20:59:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:01,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:01,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:01,431 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:59:01,452 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:59:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:01,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 20:59:01,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:01,689 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:59:01,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:01,777 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:59:01,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675622030] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:01,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:01,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-19 20:59:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023480313] [2022-07-19 20:59:01,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:01,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 20:59:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 20:59:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:59:01,796 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:59:01,798 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:59:01,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:01,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:59:01,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:01,943 INFO L129 PetriNetUnfolder]: 30/423 cut-off events. [2022-07-19 20:59:01,944 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-19 20:59:01,945 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:59:01,946 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-07-19 20:59:01,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-07-19 20:59:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 20:59:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 20:59:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-07-19 20:59:01,951 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-07-19 20:59:01,951 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-07-19 20:59:01,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-07-19 20:59:01,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:01,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-07-19 20:59:01,957 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:59:01,960 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:59:01,961 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:59:01,961 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:59:01,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-07-19 20:59:01,963 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:59:01,966 INFO L242 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-07-19 20:59:01,966 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:59:01,967 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-07-19 20:59:01,967 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-07-19 20:59:01,968 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:59:01,968 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:01,969 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:59:01,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 20:59:02,187 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:59:02,188 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:59:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-07-19 20:59:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:02,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144149323] [2022-07-19 20:59:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:02,341 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:59:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:02,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144149323] [2022-07-19 20:59:02,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144149323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:59:02,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:59:02,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 20:59:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145998631] [2022-07-19 20:59:02,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:59:02,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:59:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:02,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:59:02,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 20:59:02,348 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-07-19 20:59:02,348 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:59:02,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:02,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-07-19 20:59:02,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:02,441 INFO L129 PetriNetUnfolder]: 25/611 cut-off events. [2022-07-19 20:59:02,442 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-19 20:59:02,443 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:59:02,444 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-07-19 20:59:02,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-07-19 20:59:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:59:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 20:59:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-07-19 20:59:02,447 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-07-19 20:59:02,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-07-19 20:59:02,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-07-19 20:59:02,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:02,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-07-19 20:59:02,449 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:59:02,450 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:59:02,450 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:59:02,451 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:59:02,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-07-19 20:59:02,454 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:59:02,457 INFO L242 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-07-19 20:59:02,458 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:59:02,460 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-07-19 20:59:02,460 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-07-19 20:59:02,460 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:59:02,460 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:02,461 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:59:02,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 20:59:02,462 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:59:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash -733343356, now seen corresponding path program 1 times [2022-07-19 20:59:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:02,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525075040] [2022-07-19 20:59:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:02,611 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:59:02,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:02,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525075040] [2022-07-19 20:59:02,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525075040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:02,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956659499] [2022-07-19 20:59:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:02,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:02,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:02,616 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:59:02,649 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:59:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:02,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 20:59:02,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:02,980 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:59:02,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:03,160 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:59:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956659499] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:03,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:03,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-19 20:59:03,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786981993] [2022-07-19 20:59:03,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:03,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 20:59:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 20:59:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-19 20:59:03,167 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:59:03,170 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:59:03,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:03,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:59:03,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:03,477 INFO L129 PetriNetUnfolder]: 58/747 cut-off events. [2022-07-19 20:59:03,477 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-07-19 20:59:03,479 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:59:03,481 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-07-19 20:59:03,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-07-19 20:59:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 20:59:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-19 20:59:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-07-19 20:59:03,490 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-07-19 20:59:03,490 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-07-19 20:59:03,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-07-19 20:59:03,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:03,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-07-19 20:59:03,501 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:59:03,509 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:59:03,511 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:59:03,511 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:59:03,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-07-19 20:59:03,514 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:59:03,517 INFO L242 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-07-19 20:59:03,518 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:59:03,518 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-07-19 20:59:03,518 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-07-19 20:59:03,520 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:59:03,520 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:03,520 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:59:03,543 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:59:03,738 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:59:03,738 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:59:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2142412128, now seen corresponding path program 2 times [2022-07-19 20:59:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:03,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480868861] [2022-07-19 20:59:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:04,041 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:59:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:04,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480868861] [2022-07-19 20:59:04,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480868861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:04,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837885217] [2022-07-19 20:59:04,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 20:59:04,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:04,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:04,044 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:59:04,045 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:59:04,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 20:59:04,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:59:04,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 20:59:04,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:04,579 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:59:04,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:05,014 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:59:05,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837885217] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:05,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:05,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-07-19 20:59:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338509404] [2022-07-19 20:59:05,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:05,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 20:59:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:05,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 20:59:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 20:59:05,029 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:59:05,042 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:59:05,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:05,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:59:05,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:05,909 INFO L129 PetriNetUnfolder]: 114/1393 cut-off events. [2022-07-19 20:59:05,910 INFO L130 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-07-19 20:59:05,914 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:59:05,917 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-07-19 20:59:05,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-07-19 20:59:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-19 20:59:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-07-19 20:59:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-07-19 20:59:05,937 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-07-19 20:59:05,937 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-07-19 20:59:05,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-07-19 20:59:05,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:05,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-07-19 20:59:05,960 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:59:05,978 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:59:05,981 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:59:05,981 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:59:05,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-07-19 20:59:05,992 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:59:05,996 INFO L242 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-07-19 20:59:05,997 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:59:05,999 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-07-19 20:59:05,999 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-07-19 20:59:06,001 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:59:06,001 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:06,002 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:59:06,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 20:59:06,215 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:59:06,216 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:59:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash 681727648, now seen corresponding path program 3 times [2022-07-19 20:59:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:06,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870771949] [2022-07-19 20:59:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:06,908 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:59:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:06,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870771949] [2022-07-19 20:59:06,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870771949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:06,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451059697] [2022-07-19 20:59:06,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 20:59:06,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:06,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:06,912 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:59:06,914 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:59:07,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 20:59:07,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:59:07,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 20:59:07,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:08,926 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:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 20:59:08,991 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:09,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 20:59:09,186 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 20:59:09,187 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-07-19 20:59:09,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 20:59:09,223 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:09,246 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:09,277 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:09,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:09,523 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| 3204)) 800)) is different from false [2022-07-19 20:59:09,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 20:59:09,560 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:09,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 20:59:09,570 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:09,575 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:10,347 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:10,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451059697] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:10,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:10,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-07-19 20:59:10,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620940948] [2022-07-19 20:59:10,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:10,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-19 20:59:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:10,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-19 20:59:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2291, Unknown=1, NotChecked=100, Total=2756 [2022-07-19 20:59:10,359 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-07-19 20:59:10,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 243 transitions, 870 flow. Second operand has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 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:10,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:10,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-07-19 20:59:10,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:20,735 INFO L129 PetriNetUnfolder]: 2125/7558 cut-off events. [2022-07-19 20:59:20,735 INFO L130 PetriNetUnfolder]: For 2826/2826 co-relation queries the response was YES. [2022-07-19 20:59:20,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 7558 events. 2125/7558 cut-off events. For 2826/2826 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 40034 event pairs, 33 based on Foata normal form. 8/7466 useless extension candidates. Maximal degree in co-relation 15794. Up to 687 conditions per place. [2022-07-19 20:59:20,795 INFO L132 encePairwiseOnDemand]: 210/231 looper letters, 871 selfloop transitions, 372 changer transitions 0/1379 dead transitions. [2022-07-19 20:59:20,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1379 transitions, 6630 flow [2022-07-19 20:59:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-07-19 20:59:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2022-07-19 20:59:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 30418 transitions. [2022-07-19 20:59:20,842 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.727511898782617 [2022-07-19 20:59:20,842 INFO L72 ComplementDD]: Start complementDD. Operand 181 states and 30418 transitions. [2022-07-19 20:59:20,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 30418 transitions. [2022-07-19 20:59:20,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:20,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 181 states and 30418 transitions. [2022-07-19 20:59:20,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 182 states, 181 states have (on average 168.05524861878453) internal successors, (30418), 181 states have internal predecessors, (30418), 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:20,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 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:20,990 INFO L81 ComplementDD]: Finished complementDD. Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 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:20,991 INFO L186 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 181 states and 30418 transitions. [2022-07-19 20:59:20,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1379 transitions, 6630 flow [2022-07-19 20:59:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 1379 transitions, 6515 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-07-19 20:59:21,029 INFO L242 Difference]: Finished difference. Result has 515 places, 648 transitions, 3382 flow [2022-07-19 20:59:21,030 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=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=181, PETRI_FLOW=3382, PETRI_PLACES=515, PETRI_TRANSITIONS=648} [2022-07-19 20:59:21,030 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 302 predicate places. [2022-07-19 20:59:21,031 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 648 transitions, 3382 flow [2022-07-19 20:59:21,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 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:21,033 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:21,034 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:21,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 20:59:21,250 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:21,250 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:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1049680381, now seen corresponding path program 1 times [2022-07-19 20:59:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:21,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253840280] [2022-07-19 20:59:21,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:22,061 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:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:22,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253840280] [2022-07-19 20:59:22,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253840280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:22,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804084910] [2022-07-19 20:59:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:22,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:22,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:22,063 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:22,065 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:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:22,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-19 20:59:22,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:23,058 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:23,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:24,400 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:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804084910] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:24,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:24,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-07-19 20:59:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574860752] [2022-07-19 20:59:24,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:24,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-19 20:59:24,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:24,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-19 20:59:24,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-07-19 20:59:24,414 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:59:24,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 648 transitions, 3382 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:24,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:24,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:59:24,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 20:59:30,950 INFO L129 PetriNetUnfolder]: 927/8255 cut-off events. [2022-07-19 20:59:30,951 INFO L130 PetriNetUnfolder]: For 115977/115977 co-relation queries the response was YES. [2022-07-19 20:59:31,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26430 conditions, 8255 events. 927/8255 cut-off events. For 115977/115977 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 37468 event pairs, 7 based on Foata normal form. 102/8349 useless extension candidates. Maximal degree in co-relation 26337. Up to 590 conditions per place. [2022-07-19 20:59:31,048 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 170 selfloop transitions, 162 changer transitions 0/873 dead transitions. [2022-07-19 20:59:31,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 873 transitions, 5718 flow [2022-07-19 20:59:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-07-19 20:59:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-07-19 20:59:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 21274 transitions. [2022-07-19 20:59:31,066 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9302549302549302 [2022-07-19 20:59:31,067 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 21274 transitions. [2022-07-19 20:59:31,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 21274 transitions. [2022-07-19 20:59:31,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 20:59:31,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 21274 transitions. [2022-07-19 20:59:31,099 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:31,121 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:31,125 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:31,125 INFO L186 Difference]: Start difference. First operand has 515 places, 648 transitions, 3382 flow. Second operand 99 states and 21274 transitions. [2022-07-19 20:59:31,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 873 transitions, 5718 flow [2022-07-19 20:59:31,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 873 transitions, 5538 flow, removed 4 selfloop flow, removed 45 redundant places. [2022-07-19 20:59:31,390 INFO L242 Difference]: Finished difference. Result has 586 places, 715 transitions, 4472 flow [2022-07-19 20:59:31,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3202, 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=4472, PETRI_PLACES=586, PETRI_TRANSITIONS=715} [2022-07-19 20:59:31,392 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 373 predicate places. [2022-07-19 20:59:31,392 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 715 transitions, 4472 flow [2022-07-19 20:59:31,394 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:31,394 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 20:59:31,394 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:31,412 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:31,594 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:31,595 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:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:59:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1964703088, now seen corresponding path program 2 times [2022-07-19 20:59:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:59:31,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157799816] [2022-07-19 20:59:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:59:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:59:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:59:33,554 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:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:59:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157799816] [2022-07-19 20:59:33,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157799816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:59:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101857974] [2022-07-19 20:59:33,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 20:59:33,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:59:33,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:59:33,557 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:33,558 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:34,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 20:59:34,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:59:34,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-19 20:59:34,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:59:35,287 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:35,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:59:39,425 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:39,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101857974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:59:39,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:59:39,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-07-19 20:59:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008402676] [2022-07-19 20:59:39,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:59:39,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-07-19 20:59:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:59:39,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-07-19 20:59:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-07-19 20:59:39,460 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-19 20:59:39,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 715 transitions, 4472 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:39,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 20:59:39,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-19 20:59:39,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:00:02,374 INFO L129 PetriNetUnfolder]: 1811/16517 cut-off events. [2022-07-19 21:00:02,374 INFO L130 PetriNetUnfolder]: For 328982/328982 co-relation queries the response was YES. [2022-07-19 21:00:02,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55498 conditions, 16517 events. 1811/16517 cut-off events. For 328982/328982 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 75799 event pairs, 7 based on Foata normal form. 204/16713 useless extension candidates. Maximal degree in co-relation 55388. Up to 1474 conditions per place. [2022-07-19 21:00:02,573 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 340 selfloop transitions, 298 changer transitions 0/1179 dead transitions. [2022-07-19 21:00:02,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1179 transitions, 9852 flow [2022-07-19 21:00:02,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-07-19 21:00:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-07-19 21:00:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 43187 transitions. [2022-07-19 21:00:02,603 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.930132885356766 [2022-07-19 21:00:02,604 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 43187 transitions. [2022-07-19 21:00:02,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 43187 transitions. [2022-07-19 21:00:02,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:00:02,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 43187 transitions. [2022-07-19 21:00:02,665 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 21:00:02,716 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 21:00:02,725 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 21:00:02,725 INFO L186 Difference]: Start difference. First operand has 586 places, 715 transitions, 4472 flow. Second operand 201 states and 43187 transitions. [2022-07-19 21:00:02,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1179 transitions, 9852 flow [2022-07-19 21:00:03,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 1179 transitions, 9242 flow, removed 208 selfloop flow, removed 48 redundant places. [2022-07-19 21:00:03,379 INFO L242 Difference]: Finished difference. Result has 773 places, 852 transitions, 6800 flow [2022-07-19 21:00:03,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=4134, 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=6800, PETRI_PLACES=773, PETRI_TRANSITIONS=852} [2022-07-19 21:00:03,381 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 560 predicate places. [2022-07-19 21:00:03,381 INFO L495 AbstractCegarLoop]: Abstraction has has 773 places, 852 transitions, 6800 flow [2022-07-19 21:00:03,384 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 21:00:03,384 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:00:03,385 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 21:00:03,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 21:00:03,585 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 21:00:03,586 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 21:00:03,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:00:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -557634813, now seen corresponding path program 3 times [2022-07-19 21:00:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:00:03,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615067824] [2022-07-19 21:00:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:00:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:00:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:00:10,254 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 21:00:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:00:10,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615067824] [2022-07-19 21:00:10,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615067824] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:00:10,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893335415] [2022-07-19 21:00:10,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:00:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:00:10,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:00:10,260 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 21:00:10,264 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 21:00:10,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 21:00:10,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:00:10,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-19 21:00:11,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:00:16,202 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:16,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:00:16,312 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:16,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:00:16,656 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 21:00:16,656 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:16,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:00:16,710 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:17,000 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:17,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:00:17,095 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:17,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:00:17,418 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 21:00:17,418 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-07-19 21:00:17,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:00:17,458 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:17,485 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:17,563 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:17,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:00:18,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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)) 800))) is different from false [2022-07-19 21:00:18,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#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:18,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |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)) 800))) is different from false [2022-07-19 21:00:18,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 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:18,571 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2809 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |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)) 800))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-07-19 21:00:18,604 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |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)))))))) is different from false [2022-07-19 21:00:18,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-07-19 21:00:18,669 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) is different from false [2022-07-19 21:00:18,720 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) is different from false [2022-07-19 21:00:18,813 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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) is different from false [2022-07-19 21:00:18,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:00:18,885 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:18,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:00:18,897 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:18,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:00:18,907 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 290 treesize of output 270 [2022-07-19 21:00:18,916 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 261 treesize of output 237 [2022-07-19 21:00:18,945 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:19,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:00:19,051 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 186 treesize of output 174 [2022-07-19 21:00:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 1687 proven. 1500 refuted. 256 times theorem prover too weak. 62816 trivial. 2217 not checked. [2022-07-19 21:00:21,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893335415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:00:21,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:00:21,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 19, 24] total 176 [2022-07-19 21:00:21,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062019306] [2022-07-19 21:00:21,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:00:21,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 176 states [2022-07-19 21:00:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:00:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2022-07-19 21:00:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4984, Invalid=22362, Unknown=84, NotChecked=3370, Total=30800 [2022-07-19 21:00:21,840 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 231 [2022-07-19 21:00:21,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 852 transitions, 6800 flow. Second operand has 176 states, 176 states have (on average 166.47727272727272) internal successors, (29300), 176 states have internal predecessors, (29300), 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:21,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:00:21,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 231 [2022-07-19 21:00:21,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:00:22,719 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (= |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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:23,211 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork0_~i~0#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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:23,693 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:24,147 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:24,744 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:26,786 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:28,966 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-19 21:00:29,492 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:30,096 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-19 21:00:30,712 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:31,180 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:31,727 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:32,582 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:33,092 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:35,180 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:37,243 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:40,921 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:41,452 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:42,432 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:42,991 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:44,374 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:46,800 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:50,771 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:51,423 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:51,944 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:52,530 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:53,117 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:53,639 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:54,106 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:55,013 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:55,541 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:57,919 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |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) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:00:59,948 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:01:03,120 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| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:04,745 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:05,322 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| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:05,808 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:01:06,302 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:07,045 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (<= |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:01:08,226 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:10,452 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:11,096 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| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:13,842 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| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:17,280 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:18,034 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-19 21:01:19,560 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:20,066 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:20,611 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:21,075 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:22,946 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:23,489 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:25,644 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:27,682 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (<= |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|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:33,228 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:33,910 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:34,965 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:35,539 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:36,292 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:36,780 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:38,580 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:39,208 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:41,609 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:43,749 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |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) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:49,058 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:49,624 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:01:50,671 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:51,270 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:51,866 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (<= |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:52,363 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:54,246 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:54,905 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:57,329 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:59,395 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:02:04,957 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:05,549 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-19 21:02:06,852 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:07,478 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:02:08,130 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:02:08,647 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |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)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:10,799 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (<= |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:11,460 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:14,113 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |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) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:16,284 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |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) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:22,545 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:23,139 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:23,614 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:25,113 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:25,762 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:26,438 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:26,951 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:29,434 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:30,123 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:32,631 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |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) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:34,815 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 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:41,626 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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|) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:42,247 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:42,783 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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) (= 7 |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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:44,197 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 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:44,860 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:45,714 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:46,239 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |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)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 800))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:48,739 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (<= |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:49,439 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) (= 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:52,153 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |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) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-19 21:02:54,358 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~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| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false