./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 16:24:17,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 16:24:17,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 16:24:17,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 16:24:17,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 16:24:17,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 16:24:17,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 16:24:17,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 16:24:17,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 16:24:17,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 16:24:17,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 16:24:17,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 16:24:17,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 16:24:17,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 16:24:17,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 16:24:17,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 16:24:17,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 16:24:17,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 16:24:17,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 16:24:17,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 16:24:17,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 16:24:17,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 16:24:17,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 16:24:17,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 16:24:17,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 16:24:17,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 16:24:17,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 16:24:17,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 16:24:17,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 16:24:17,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 16:24:17,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 16:24:17,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 16:24:17,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 16:24:17,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 16:24:17,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 16:24:17,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 16:24:17,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 16:24:17,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 16:24:17,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 16:24:17,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 16:24:17,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 16:24:17,537 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-11-20 16:24:17,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 16:24:17,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 16:24:17,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 16:24:17,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 16:24:17,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 16:24:17,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 16:24:17,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 16:24:17,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 16:24:17,581 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 16:24:17,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 16:24:17,582 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 16:24:17,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 16:24:17,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 16:24:17,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 16:24:17,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 16:24:17,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 16:24:17,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 16:24:17,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 16:24:17,584 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 16:24:17,584 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 16:24:17,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 16:24:17,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 16:24:17,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 16:24:17,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 16:24:17,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 16:24:17,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 16:24:17,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:24:17,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 16:24:17,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 16:24:17,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 16:24:17,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 16:24:17,588 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-20 16:24:17,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 16:24:17,588 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 16:24:17,589 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-20 16:24:17,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-20 16:24:17,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 16:24:17,589 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-20 16:24:17,590 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-20 16:24:17,590 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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-11-20 16:24:17,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 16:24:17,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 16:24:17,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 16:24:17,946 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 16:24:17,947 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 16:24:17,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-20 16:24:21,044 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 16:24:21,365 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 16:24:21,366 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-20 16:24:21,382 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/data/99df58be3/984d0f95746c4a5881c1c9a1c5d8f4d6/FLAG0be0f63b4 [2022-11-20 16:24:21,405 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/data/99df58be3/984d0f95746c4a5881c1c9a1c5d8f4d6 [2022-11-20 16:24:21,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 16:24:21,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 16:24:21,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 16:24:21,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 16:24:21,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 16:24:21,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:24:21" (1/1) ... [2022-11-20 16:24:21,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73448df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:21, skipping insertion in model container [2022-11-20 16:24:21,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:24:21" (1/1) ... [2022-11-20 16:24:21,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 16:24:21,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 16:24:22,195 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-20 16:24:22,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-20 16:24:22,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:24:22,230 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 16:24:22,279 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-20 16:24:22,282 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-20 16:24:22,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:24:22,343 INFO L208 MainTranslator]: Completed translation [2022-11-20 16:24:22,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22 WrapperNode [2022-11-20 16:24:22,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 16:24:22,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 16:24:22,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 16:24:22,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 16:24:22,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,431 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-20 16:24:22,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 16:24:22,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 16:24:22,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 16:24:22,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 16:24:22,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,496 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 16:24:22,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 16:24:22,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 16:24:22,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 16:24:22,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (1/1) ... [2022-11-20 16:24:22,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:24:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:24:22,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 16:24:22,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 16:24:22,594 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 16:24:22,595 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 16:24:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 16:24:22,595 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 16:24:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 16:24:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 16:24:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 16:24:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 16:24:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 16:24:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 16:24:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 16:24:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 16:24:22,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 16:24:22,598 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 16:24:22,825 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 16:24:22,827 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 16:24:23,204 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 16:24:23,213 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 16:24:23,213 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 16:24:23,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:24:23 BoogieIcfgContainer [2022-11-20 16:24:23,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 16:24:23,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 16:24:23,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 16:24:23,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 16:24:23,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:24:21" (1/3) ... [2022-11-20 16:24:23,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b992828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:24:23, skipping insertion in model container [2022-11-20 16:24:23,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:22" (2/3) ... [2022-11-20 16:24:23,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b992828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:24:23, skipping insertion in model container [2022-11-20 16:24:23,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:24:23" (3/3) ... [2022-11-20 16:24:23,225 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-20 16:24:23,234 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 16:24:23,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 16:24:23,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-20 16:24:23,246 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 16:24:23,422 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 16:24:23,513 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:24:23,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-20 16:24:23,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:24:23,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-20 16:24:23,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-20 16:24:23,564 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-20 16:24:23,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-20 16:24:23,583 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e906e18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:24:23,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 16:24:24,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:24:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:24:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1319727467, now seen corresponding path program 1 times [2022-11-20 16:24:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:24:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988257094] [2022-11-20 16:24:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:24:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:24:24,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988257094] [2022-11-20 16:24:24,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988257094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:24:24,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:24:24,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 16:24:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385343280] [2022-11-20 16:24:24,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:24:24,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 16:24:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:24,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 16:24:24,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 16:24:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:24,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:24,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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-11-20 16:24:24,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:24,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 16:24:24,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:24:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:24:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1423842390, now seen corresponding path program 1 times [2022-11-20 16:24:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:24:24,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450727545] [2022-11-20 16:24:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:24:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:24:25,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450727545] [2022-11-20 16:24:25,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450727545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:24:25,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:24:25,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:24:25,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152721759] [2022-11-20 16:24:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:24:25,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 16:24:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:25,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 16:24:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 16:24:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:25,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:25,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-11-20 16:24:25,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:25,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:25,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 16:24:25,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:24:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:24:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1119853959, now seen corresponding path program 1 times [2022-11-20 16:24:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:24:25,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963527738] [2022-11-20 16:24:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:24:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:28,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:24:28,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963527738] [2022-11-20 16:24:28,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963527738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:24:28,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:24:28,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:24:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590865526] [2022-11-20 16:24:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:24:28,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 16:24:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 16:24:28,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-20 16:24:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:28,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:28,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.0) internal successors, (95), 20 states have internal predecessors, (95), 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-11-20 16:24:28,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:28,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:28,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:24:29,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 16:24:29,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:24:29,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:24:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash -828858809, now seen corresponding path program 1 times [2022-11-20 16:24:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:24:29,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220056664] [2022-11-20 16:24:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:24:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:24:29,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220056664] [2022-11-20 16:24:29,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220056664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:24:29,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:24:29,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:24:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814778266] [2022-11-20 16:24:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:24:29,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:24:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:24:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:24:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:29,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:29,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 37.0) internal successors, (111), 4 states have internal predecessors, (111), 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-11-20 16:24:29,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:29,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:29,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:24:29,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:24:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:30,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 16:24:30,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:24:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:24:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1017669425, now seen corresponding path program 1 times [2022-11-20 16:24:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:24:30,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717663293] [2022-11-20 16:24:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:24:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:32,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:24:32,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717663293] [2022-11-20 16:24:32,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717663293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:24:32,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:24:32,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:24:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224939267] [2022-11-20 16:24:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:24:32,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 16:24:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 16:24:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 16:24:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:32,259 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:32,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 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-11-20 16:24:32,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:32,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:32,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:24:32,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:32,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:24:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:24:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 16:24:33,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:24:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:24:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash -91224222, now seen corresponding path program 1 times [2022-11-20 16:24:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:24:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355006303] [2022-11-20 16:24:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:24:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:24:39,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355006303] [2022-11-20 16:24:39,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355006303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:24:39,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:24:39,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:24:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992340391] [2022-11-20 16:24:39,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:24:39,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 16:24:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:39,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 16:24:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-11-20 16:24:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:39,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:39,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.526315789473684) internal successors, (105), 20 states have internal predecessors, (105), 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-11-20 16:24:39,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:39,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:39,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:24:39,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:39,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:24:39,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:24:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:24:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:24:41,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 16:24:41,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:24:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:24:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash 217716167, now seen corresponding path program 1 times [2022-11-20 16:24:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:24:41,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417889671] [2022-11-20 16:24:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:24:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:45,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:24:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417889671] [2022-11-20 16:24:45,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417889671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:24:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232690050] [2022-11-20 16:24:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:24:45,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:24:45,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:24:45,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:24:45,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 16:24:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:24:46,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 16:24:46,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:24:46,358 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:24:46,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 16:24:46,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:24:46,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:24:46,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:24:46,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:24:47,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:24:47,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:24:48,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:24:48,280 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-20 16:24:48,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:24:48,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:24:48,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:24:48,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:24:49,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:24:49,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:24:49,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:24:49,555 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:24:49,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:24:49,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:24:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:24:49,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:24:50,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_225) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-20 16:24:50,558 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_225) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-20 16:24:52,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_225) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse1 .cse3)) v_ArrVal_223))))) is different from false [2022-11-20 16:24:52,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_220)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_225) (< (+ (select .cse1 .cse3) 1) v_ArrVal_223) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 16:24:52,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_220)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_223) .cse3 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_223) (< (+ (select .cse1 .cse3) 1) v_ArrVal_225) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse3)))))) is different from false [2022-11-20 16:24:52,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4)) v_ArrVal_220)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse4 v_ArrVal_223) .cse1 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_225) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse3 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_223)))))) is different from false [2022-11-20 16:24:59,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_219))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_220)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_223) .cse3 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_225) (< (+ (select .cse2 .cse1) 1) v_ArrVal_223) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 .cse3))))))))) is different from false [2022-11-20 16:24:59,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_219))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_220)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_223) .cse1 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_225) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_223))))))) is different from false [2022-11-20 16:25:00,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:25:00,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 270 treesize of output 185 [2022-11-20 16:25:00,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:25:00,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 644 treesize of output 640 [2022-11-20 16:25:00,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 500 [2022-11-20 16:25:00,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 277 [2022-11-20 16:25:00,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 343 [2022-11-20 16:25:01,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 16:25:02,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:25:02,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 140 [2022-11-20 16:25:02,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:25:02,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-20 16:25:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-20 16:25:03,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232690050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:25:03,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:25:03,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-11-20 16:25:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353869541] [2022-11-20 16:25:03,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:25:03,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-20 16:25:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:25:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-20 16:25:03,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=5052, Unknown=59, NotChecked=1240, Total=6972 [2022-11-20 16:25:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:03,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:25:03,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 4.469879518072289) internal successors, (371), 84 states have internal predecessors, (371), 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-11-20 16:25:03,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:03,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:03,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:03,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:03,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:25:03,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:03,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:25:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 16:25:11,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 16:25:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:25:11,360 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:25:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:25:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1840732794, now seen corresponding path program 1 times [2022-11-20 16:25:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:25:11,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455108093] [2022-11-20 16:25:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:25:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:25:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:25:12,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455108093] [2022-11-20 16:25:12,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455108093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:25:12,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159314355] [2022-11-20 16:25:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:25:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:25:12,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:25:12,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 16:25:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:12,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 16:25:12,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:25:13,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:25:14,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 16:25:14,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:25:14,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 16:25:14,583 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 16:25:14,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-20 16:25:14,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 16:25:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:25:14,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:25:15,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_294 Int)) (or (< (+ v_ArrVal_294 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_293) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_294) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-11-20 16:25:15,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:25:15,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-20 16:25:15,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:25:15,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-20 16:25:15,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-20 16:25:15,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-11-20 16:25:15,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:25:15,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-11-20 16:25:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:25:16,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159314355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:25:16,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:25:16,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-11-20 16:25:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802913242] [2022-11-20 16:25:16,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:25:16,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 16:25:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:25:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 16:25:16,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2289, Unknown=11, NotChecked=98, Total=2652 [2022-11-20 16:25:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:16,222 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:25:16,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 7.313725490196078) internal successors, (373), 52 states have internal predecessors, (373), 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-11-20 16:25:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:25:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-20 16:25:16,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:25:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:25:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:25:46,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 16:25:46,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 16:25:46,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:25:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:25:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -431098475, now seen corresponding path program 1 times [2022-11-20 16:25:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:25:46,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118730283] [2022-11-20 16:25:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:25:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 16:25:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:25:46,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118730283] [2022-11-20 16:25:46,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118730283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:25:46,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:25:46,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:25:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226674471] [2022-11-20 16:25:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:25:46,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:25:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:25:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:25:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:25:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:46,689 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:25:46,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:25:46,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:46,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:46,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:46,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:46,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:25:46,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:46,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:25:46,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:25:46,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:25:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:25:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:25:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:46,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 16:25:46,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:25:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:25:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash -479150187, now seen corresponding path program 1 times [2022-11-20 16:25:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:25:46,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131781573] [2022-11-20 16:25:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:25:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:25:46,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:25:46,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131781573] [2022-11-20 16:25:46,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131781573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:25:46,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407520308] [2022-11-20 16:25:46,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:46,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:25:46,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:25:46,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:25:46,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 16:25:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:47,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 16:25:47,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:25:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:25:47,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 16:25:47,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407520308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:25:47,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 16:25:47,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 16:25:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610855929] [2022-11-20 16:25:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:25:47,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 16:25:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:25:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 16:25:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 16:25:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:47,176 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:25:47,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 38.25) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:25:47,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:47,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:47,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:47,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:47,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:25:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:25:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:25:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:25:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:25:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:25:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 16:25:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:25:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:25:47,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 16:25:47,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:25:47,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:25:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:25:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1890333377, now seen corresponding path program 1 times [2022-11-20 16:25:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:25:47,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534440468] [2022-11-20 16:25:47,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:25:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:25:50,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:25:50,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534440468] [2022-11-20 16:25:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534440468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:25:50,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002476394] [2022-11-20 16:25:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:50,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:25:50,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:25:50,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:25:50,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 16:25:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:50,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 16:25:50,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:25:51,139 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:25:51,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 16:25:51,213 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:25:51,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:25:51,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:25:51,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:25:52,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:25:52,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:25:52,692 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-11-20 16:25:52,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2022-11-20 16:25:53,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:25:53,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-11-20 16:25:53,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2022-11-20 16:25:54,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:25:54,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-20 16:25:54,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:25:54,810 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-11-20 16:25:54,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2022-11-20 16:25:55,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:25:55,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:25:55,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-11-20 16:25:55,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-20 16:25:56,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:25:56,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:25:56,471 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:25:56,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:25:56,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:25:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:25:56,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:25:57,382 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 16:25:58,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_492)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_496 1)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_494) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< 800 (select .cse0 .cse3)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-20 16:25:58,854 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_492))) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 800 (select .cse0 .cse1)) (not (<= v_ArrVal_496 1)) (< (+ (select .cse0 .cse2) 1) v_ArrVal_494) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-11-20 16:26:00,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) v_ArrVal_492))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_494) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647) (< 800 (select .cse0 .cse3)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (not (<= v_ArrVal_496 1))))))) is different from false [2022-11-20 16:26:00,265 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_492))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 800 (select .cse0 .cse1)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= v_ArrVal_496 1)) (< (+ (select .cse0 .cse3) 1) v_ArrVal_494) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1)))))))) is different from false [2022-11-20 16:26:00,301 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) v_ArrVal_492))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (< 800 (select .cse0 .cse3)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647)))))) is different from false [2022-11-20 16:26:01,031 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_487) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= v_ArrVal_496 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_494) (< 800 (select .cse2 .cse1)) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= v_ArrVal_487 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) (= .cse8 800)))) is different from false [2022-11-20 16:26:01,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_487) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= v_ArrVal_496 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_494) (< 800 (select .cse2 .cse1)) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_487)))))) (= .cse8 800)))) is different from false [2022-11-20 16:26:01,272 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse2 .cse8))) (or (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_487) .cse8 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse4 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_487) (not (<= v_ArrVal_496 1)) (< (+ (select .cse4 .cse5) 1) v_ArrVal_494) (< 800 (select .cse4 .cse1)) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse5) 2147483647))))))) (= .cse9 800)))) is different from false [2022-11-20 16:26:01,413 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_485)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select .cse4 .cse9))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_487) .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse6 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse2)) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_494) .cse2 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (= 800 .cse0) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_487) (< (+ (select .cse6 .cse3) 1) v_ArrVal_494) (< 800 (select .cse6 .cse2))))))))) is different from false [2022-11-20 16:26:01,508 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_485))) (let ((.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select .cse6 .cse1))) (let ((.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_487) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse5 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse8) 4)) v_ArrVal_492))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_494) .cse8 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= v_ArrVal_496 1)) (= .cse4 800) (< (+ (select .cse5 .cse3) 1) v_ArrVal_494) (< (+ (select .cse6 .cse7) 1) v_ArrVal_487) (< 800 (select .cse5 .cse8)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse8))))))))))))) is different from false [2022-11-20 16:26:01,684 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_485)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse0 (select .cse7 .cse5))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_487) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse6 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_494) .cse2 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (= .cse0 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse4 .cse5))) (not (<= v_ArrVal_496 1)) (< (+ (select .cse6 .cse3) 1) v_ArrVal_494) (< (+ 1 (select .cse7 .cse8)) v_ArrVal_487) (< 800 (select .cse6 .cse2)))))))))) is different from false [2022-11-20 16:26:06,398 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (v_ArrVal_494 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_~#queue~0.offset|) v_ArrVal_485)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse2 .cse1))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_487) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) v_ArrVal_492)))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 800 (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_487) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse5 .cse1))) (= .cse6 800) (< (+ (select .cse0 .cse3) 1) v_ArrVal_494) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 .cse1)))))))))))) is different from false [2022-11-20 16:26:07,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:26:07,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1107 treesize of output 787 [2022-11-20 16:26:07,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:26:07,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3984 treesize of output 3942 [2022-11-20 16:26:07,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1764 treesize of output 1700 [2022-11-20 16:26:07,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3390 treesize of output 3262 [2022-11-20 16:26:08,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1742 treesize of output 1614 [2022-11-20 16:26:08,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2906 treesize of output 2714 [2022-11-20 16:26:08,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:26:29,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:26:29,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1421 treesize of output 1399 [2022-11-20 16:26:34,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:26:34,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-20 16:26:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-20 16:26:34,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002476394] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:26:34,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:26:34,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 39, 41] total 105 [2022-11-20 16:26:34,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459841362] [2022-11-20 16:26:34,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:26:34,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-11-20 16:26:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:26:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-11-20 16:26:34,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=696, Invalid=7642, Unknown=86, NotChecked=2496, Total=10920 [2022-11-20 16:26:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:26:34,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:26:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 4.552380952380952) internal successors, (478), 105 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:26:34,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:26:34,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:26:34,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:26:34,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:26:34,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:26:34,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:26:34,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-20 16:26:34,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:26:34,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:26:34,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:26:34,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:27:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:27:30,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 16:27:30,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:27:30,224 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash -38506192, now seen corresponding path program 1 times [2022-11-20 16:27:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:30,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472544427] [2022-11-20 16:27:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:30,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:33,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:33,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472544427] [2022-11-20 16:27:33,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472544427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:27:33,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327463577] [2022-11-20 16:27:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:33,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:27:33,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:27:33,196 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:27:33,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 16:27:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:33,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 16:27:33,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:27:33,510 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:27:33,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 16:27:33,573 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:27:33,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:27:33,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:27:33,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:27:34,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:27:34,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:27:35,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:27:35,108 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:27:35,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:27:35,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:27:35,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:27:35,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:27:35,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:27:35,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:27:36,017 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:27:36,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:27:36,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:27:36,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 16:27:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:36,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:27:36,486 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:27:36,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:27:36,668 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:27:36,684 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) is different from false [2022-11-20 16:27:36,846 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1)) 2147483647)) (= .cse4 800)))) is different from false [2022-11-20 16:27:36,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_572)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1)) 2147483647) (= .cse4 800))))) is different from false [2022-11-20 16:27:36,940 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_572))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse2)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse4)))))) is different from false [2022-11-20 16:27:36,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_572)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (= .cse2 800) (< (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_574) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse4)) 2147483647)))))) is different from false [2022-11-20 16:27:37,380 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_571))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_572)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_574) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1) 2147483647) (= .cse4 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse1))))))))) is different from false [2022-11-20 16:27:37,585 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_570) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_571))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_572)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_574) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1) 2147483647) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse1))))))))) is different from false [2022-11-20 16:27:38,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:38,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 297 treesize of output 197 [2022-11-20 16:27:38,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:38,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 533 treesize of output 529 [2022-11-20 16:27:38,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 287 [2022-11-20 16:27:38,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 595 treesize of output 555 [2022-11-20 16:27:38,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 410 [2022-11-20 16:27:38,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:27:40,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:40,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 735 treesize of output 607 [2022-11-20 16:27:40,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:40,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-11-20 16:27:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-20 16:27:41,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327463577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:27:41,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:27:41,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 29] total 76 [2022-11-20 16:27:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229627830] [2022-11-20 16:27:41,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:27:41,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-20 16:27:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:41,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-20 16:27:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=3892, Unknown=34, NotChecked=1390, Total=5852 [2022-11-20 16:27:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:41,345 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:41,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 5.276315789473684) internal successors, (401), 77 states have internal predecessors, (401), 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-11-20 16:27:41,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:41,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:41,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:41,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:27:41,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:27:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:27:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:27:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:27:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:27:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:27:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:27:48,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 16:27:48,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 16:27:48,264 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:48,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1193691313, now seen corresponding path program 1 times [2022-11-20 16:27:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672624768] [2022-11-20 16:27:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:49,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:49,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672624768] [2022-11-20 16:27:49,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672624768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:27:49,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702713390] [2022-11-20 16:27:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:49,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:27:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:27:49,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:27:49,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 16:27:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:49,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 16:27:49,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:27:50,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:27:50,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:27:50,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 16:27:50,918 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 16:27:50,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-20 16:27:51,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 16:27:51,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-20 16:27:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:51,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:27:51,772 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_649) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_650) (+ |c_~#queue~0.offset| 3204)) 2147483650)) (< (+ v_ArrVal_650 2147483648) 0))) is different from false [2022-11-20 16:27:51,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:51,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-11-20 16:27:51,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:51,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-20 16:27:51,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-20 16:27:51,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-11-20 16:27:51,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:51,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-11-20 16:27:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:52,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702713390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:27:52,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:27:52,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-11-20 16:27:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151507805] [2022-11-20 16:27:52,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:27:52,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 16:27:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 16:27:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1892, Unknown=1, NotChecked=88, Total=2162 [2022-11-20 16:27:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:52,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:52,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 8.76086956521739) internal successors, (403), 47 states have internal predecessors, (403), 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-11-20 16:27:52,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:52,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:52,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:52,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:52,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:27:52,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:27:52,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:27:52,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:27:52,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:52,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:27:52,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:27:52,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:27:52,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:09,225 WARN L233 SmtUtils]: Spent 12.58s on a formula simplification. DAG size of input: 87 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:29:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:29:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:29:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:29:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:29:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:29:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:29:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:29:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-20 16:29:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:29:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:29:16,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 16:29:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 16:29:16,692 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:29:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:29:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1413197191, now seen corresponding path program 2 times [2022-11-20 16:29:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:29:16,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813694478] [2022-11-20 16:29:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:29:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:29:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:29:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 143 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:29:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:29:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813694478] [2022-11-20 16:29:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813694478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:29:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447447474] [2022-11-20 16:29:18,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:29:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:29:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:29:18,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:29:18,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 16:29:18,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:29:18,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:29:18,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 16:29:18,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:29:19,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:29:19,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:19,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:29:20,192 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:29:20,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:29:20,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:29:20,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 16:29:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 146 proven. 76 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 16:29:20,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:29:20,675 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| Int) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_765 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| 4) |c_~#queue~0.offset|) v_ArrVal_765) .cse1)))))) is different from false [2022-11-20 16:29:20,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:20,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-11-20 16:29:20,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:20,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-11-20 16:29:20,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-11-20 16:29:20,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:29:20,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:20,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-11-20 16:29:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 131 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 12 not checked. [2022-11-20 16:29:21,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447447474] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:29:21,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:29:21,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 37 [2022-11-20 16:29:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596809267] [2022-11-20 16:29:21,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:29:21,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 16:29:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:29:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 16:29:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1105, Unknown=1, NotChecked=68, Total=1332 [2022-11-20 16:29:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:21,282 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:29:21,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 13.891891891891891) internal successors, (514), 37 states have internal predecessors, (514), 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-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:29:21,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:21,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:29:21,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-20 16:29:21,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:29:21,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:29:21,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:29:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:29:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:29:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:29:22,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 16:29:22,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 16:29:22,499 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:29:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:29:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash -84225416, now seen corresponding path program 1 times [2022-11-20 16:29:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:29:22,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232720311] [2022-11-20 16:29:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:29:22,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:29:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:29:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:29:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:29:24,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232720311] [2022-11-20 16:29:24,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232720311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:29:24,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400631323] [2022-11-20 16:29:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:29:24,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:29:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:29:24,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:29:24,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 16:29:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:29:24,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 16:29:24,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:29:25,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:29:25,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:25,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:29:25,980 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:29:25,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:29:26,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:29:26,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 16:29:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:29:26,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:29:26,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| Int) (v_ArrVal_868 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_867) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| 4) |c_~#queue~0.offset|) v_ArrVal_868) .cse1) 2147483647)))) is different from false [2022-11-20 16:29:26,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:26,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-11-20 16:29:26,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:26,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 80 [2022-11-20 16:29:26,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-11-20 16:29:26,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:29:26,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:26,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-11-20 16:29:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 32 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 12 not checked. [2022-11-20 16:29:27,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400631323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:29:27,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:29:27,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 39 [2022-11-20 16:29:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231054947] [2022-11-20 16:29:27,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:29:27,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 16:29:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:29:27,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 16:29:27,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1324, Unknown=1, NotChecked=74, Total=1560 [2022-11-20 16:29:27,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:27,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:29:27,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 12.64102564102564) internal successors, (493), 40 states have internal predecessors, (493), 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-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:29:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:29:27,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:29:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:29:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:29:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-20 16:29:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 16:29:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:29:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:29:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:29:28,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 16:29:28,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 16:29:28,981 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:29:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:29:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1981507569, now seen corresponding path program 3 times [2022-11-20 16:29:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:29:28,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629246754] [2022-11-20 16:29:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:29:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:29:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:29:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 174 proven. 85 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 16:29:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:29:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629246754] [2022-11-20 16:29:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629246754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:29:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128157138] [2022-11-20 16:29:33,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:29:33,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:29:33,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:29:33,416 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:29:33,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 16:29:34,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 16:29:34,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:29:34,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-20 16:29:34,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:29:34,176 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:29:34,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 16:29:34,242 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:29:34,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:29:34,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:29:34,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:29:35,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:29:35,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:29:35,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:29:35,989 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-20 16:29:35,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:29:36,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:36,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:29:36,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:29:36,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-20 16:29:36,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:36,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:29:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:37,202 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-11-20 16:29:37,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2022-11-20 16:29:37,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:29:37,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-11-20 16:29:38,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2022-11-20 16:29:38,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:38,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-20 16:29:39,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:29:39,236 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-11-20 16:29:39,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2022-11-20 16:29:39,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:39,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:29:39,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-11-20 16:29:40,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-20 16:29:40,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:40,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:29:40,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:29:40,959 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-20 16:29:40,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:29:41,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:41,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:29:41,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:29:41,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:29:41,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:29:41,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:29:42,368 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:29:42,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:29:42,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:29:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:29:42,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:29:43,180 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 16:29:43,252 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1013 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-11-20 16:29:43,300 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_1013) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-20 16:29:43,318 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1013) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-20 16:29:43,423 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1013) (not (<= v_ArrVal_1010 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-20 16:29:43,985 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1008)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1010) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-20 16:29:44,033 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int)) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1008)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1013) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1010)))))))) is different from false [2022-11-20 16:29:44,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1008)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1010) .cse4 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1010) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse3 .cse4))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-11-20 16:29:51,578 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse3 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1010))))))) is different from false [2022-11-20 16:30:00,642 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse5 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_1001))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1004) .cse3 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse4 .cse3))) (not (<= v_ArrVal_1006 1)) (not (= (select .cse5 .cse3) 800)) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1013) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1004) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647))))))))) is different from false [2022-11-20 16:30:01,830 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse2 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1004) (not (= (select .cse2 .cse1) 800)) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1013) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse5 .cse1))))))))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) is different from false [2022-11-20 16:30:01,904 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse2 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1004) (not (= (select .cse2 .cse1) 800)) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1013) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse5 .cse1))))))))))) (= .cse11 800)))) is different from false [2022-11-20 16:30:02,154 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_997) .cse10 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)) v_ArrVal_1001))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1004) .cse4 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1010) .cse4 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1010) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1004) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1013) (not (<= v_ArrVal_997 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse5 .cse4))) (not (= (select .cse3 .cse4) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse4))))))))))) (= .cse11 800)))) is different from false [2022-11-20 16:30:03,053 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (select .cse5 .cse11))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_997) .cse11 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse3 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)) v_ArrVal_1001))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1004) .cse4 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1010) .cse4 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1010) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1004) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1013) (< (+ 1 (select .cse5 .cse6)) v_ArrVal_997) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse7 .cse4))) (not (= (select .cse3 .cse4) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse4)))))))))))) (= .cse12 800)))) is different from false [2022-11-20 16:30:03,255 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_995)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (select .cse5 .cse12))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_997) .cse12 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse7 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1001))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1004) .cse3 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1006 1)) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1010) (< (+ (select .cse5 .cse6) 1) v_ArrVal_997) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1013) (not (= (select .cse7 .cse3) 800)) (= 800 .cse8) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1004))))))))))) is different from false [2022-11-20 16:30:03,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse0 .cse1))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_995))) (let ((.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (select .cse8 .cse1))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_997) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse5 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1001))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1004) .cse3 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse7 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (not (= (select .cse5 .cse3) 800)) (< (+ (select .cse4 .cse6) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse7 .cse3))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_997) (= .cse10 800) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1004) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse6) 2147483647)))))))))))))) is different from false [2022-11-20 16:30:03,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse0 (select .cse8 .cse7))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse8 .cse9 v_ArrVal_997) .cse7 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse1 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1001))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1004) .cse5 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse3 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1010) .cse5 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (= .cse0 800) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1004) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse2) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1010) (not (= (select .cse1 .cse5) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse3 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse6 .cse7))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_997) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse10 .cse5)))))))))))))) is different from false [2022-11-20 16:30:11,461 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse8 .cse1))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_997) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse4 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1004) (not (<= v_ArrVal_1006 1)) (= .cse6 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse7 .cse1))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1010) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse5) 2147483647) (< (+ (select .cse8 .cse5) 1) v_ArrVal_997) (not (= 800 (select .cse4 .cse1))))))))))))))) is different from false [2022-11-20 16:30:12,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (select .cse6 .cse1))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_997) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse7 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (not (<= v_ArrVal_1006 1)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (= .cse4 800) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1010) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1013) (< (+ (select .cse6 .cse3) 1) v_ArrVal_997) (not (= (select .cse7 .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse1))) (< (+ 1 (select .cse7 .cse3)) v_ArrVal_1004) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse8 .cse1))))))))))))))) is different from false [2022-11-20 16:30:13,301 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_989) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse5 .cse1))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_997) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse0 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (= (select .cse0 .cse1) 800)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse1))) (not (<= v_ArrVal_989 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= v_ArrVal_1006 1)) (< (+ 1 (select .cse5 .cse3)) v_ArrVal_997) (= 800 .cse6) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1010) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1004) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse8 .cse1))))))))))))))) is different from false [2022-11-20 16:30:14,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_989) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse4 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse5 .cse1))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_997) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse0 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (= (select .cse0 .cse1) 800)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse1))) (not (<= v_ArrVal_1006 1)) (< (+ 1 (select .cse5 .cse3)) v_ArrVal_997) (= 800 .cse6) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1010) (< (+ 1 (select .cse8 .cse9)) v_ArrVal_989) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1004) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse10 .cse1)))))))))))))))) is different from false [2022-11-20 16:30:14,621 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_989) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse7 (select .cse14 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (select .cse0 .cse8))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_997) .cse8 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse6 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1004) .cse8 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse5 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_1010) .cse8 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_997) (< (+ (select .cse2 .cse3) 1) v_ArrVal_989) (= 800 .cse4) (not (<= v_ArrVal_1006 1)) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1004) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse7 .cse8))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse5 .cse8))) (not (= 800 (select .cse6 .cse8))) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse10 .cse8))) (< (+ (select .cse9 .cse8) 1) v_ArrVal_1013)))))))))))))) is different from false [2022-11-20 16:30:14,805 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse0 .cse1))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse10 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_988)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_989) .cse1 v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (select .cse6 .cse3))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_997) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse7 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1004) .cse3 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse8 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1013) (= .cse4 800) (< (+ (select .cse2 .cse5) 1) v_ArrVal_1010) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse6 .cse5) 1) v_ArrVal_997) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1004) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse5) 2147483647) (not (= (select .cse7 .cse3) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse9 .cse3))) (< (+ (select .cse10 .cse11) 1) v_ArrVal_989) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse12 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse8 .cse3))))))))))))))))))) is different from false [2022-11-20 16:30:15,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_988)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 .cse6 v_ArrVal_989) .cse10 v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse11 (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (select .cse11 .cse3))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse11 .cse1 v_ArrVal_997) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse0 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_1001)))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1004) .cse3 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse7 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1004) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse2 .cse3))) (= 800 .cse4) (< (+ (select .cse5 .cse6) 1) v_ArrVal_989) (not (<= v_ArrVal_1006 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse7 .cse3))) (not (= 800 (select .cse0 .cse3))) (< (+ (select .cse8 .cse3) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse9 .cse10))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_997) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse12 .cse3))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1010))))))))))))))) is different from false [2022-11-20 16:30:30,212 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_986))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_988)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_989) .cse1 v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse9 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995))) (let ((.cse10 (select .cse6 .cse1))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_997) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse0 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse3 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (= (select .cse0 .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1004) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse3 .cse1))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_997) (< (+ (select .cse7 .cse4) 1) v_ArrVal_989) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse9 .cse1))) (= 800 .cse10) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1010)))))))))))))))) is different from false [2022-11-20 16:30:31,986 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_985 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| Int) (v_ArrVal_991 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_986))) (let ((.cse3 (select .cse15 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| 4)) v_ArrVal_988)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_989) .cse1 v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse7 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995))) (let ((.cse9 (select .cse6 .cse1))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_997) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) v_ArrVal_1001)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse8 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_91| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_989) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse6 .cse5) 1) v_ArrVal_997) (< (+ (select .cse2 .cse5) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse8 .cse1))) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse5) 2147483647) (= 800 .cse9) (not (= 800 (select .cse10 .cse1))) (< (+ (select .cse10 .cse5) 1) v_ArrVal_1004)))))))))))))))) is different from false [2022-11-20 16:30:37,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:37,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 6727 treesize of output 4377 [2022-11-20 16:30:37,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:37,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10544 treesize of output 10510 [2022-11-20 16:30:38,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4525 treesize of output 4517 [2022-11-20 16:30:38,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4127 treesize of output 3871 [2022-11-20 16:30:38,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 7834 treesize of output 7818 [2022-11-20 16:30:38,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 6239 treesize of output 6047 [2022-11-20 16:30:38,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 7061 treesize of output 6869 [2022-11-20 16:30:38,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 7173 treesize of output 7045 [2022-11-20 16:30:38,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:38,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 16:30:49,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:49,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2670 treesize of output 2690 [2022-11-20 16:30:54,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:54,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-20 16:30:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 108 refuted. 11 times theorem prover too weak. 0 trivial. 167 not checked. [2022-11-20 16:30:55,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128157138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:30:55,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:30:55,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 57, 62] total 149 [2022-11-20 16:30:55,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356672988] [2022-11-20 16:30:55,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:30:55,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2022-11-20 16:30:55,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:30:55,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2022-11-20 16:30:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1658, Invalid=13242, Unknown=210, NotChecked=6942, Total=22052 [2022-11-20 16:30:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:30:55,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:30:55,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 4.684563758389261) internal successors, (698), 149 states have internal predecessors, (698), 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-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:30:55,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:30:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:31:43,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse0 .cse9)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (select .cse11 .cse6))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1016) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| .cse2)))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse8 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* .cse2 4)) v_ArrVal_1001))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse8 .cse1 v_ArrVal_1004) .cse9 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1006 1)) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse3 .cse6))) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1010) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1004) (not (= 800 (select .cse8 .cse9))) (< (+ (select .cse7 .cse6) 1) v_ArrVal_1013)))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (or (< (select (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| .cse12)))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse17 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995))) (let ((.cse13 (select .cse17 .cse9))) (let ((.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse17 .cse1 v_ArrVal_997) .cse9 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse14 (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_1004) .cse6 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse18 (select .cse19 |c_~#queue~0.base|))) (let ((.cse16 (store .cse18 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse15 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (= .cse13 800) (< (+ (select .cse14 .cse4) 1) v_ArrVal_1004) (< (select (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (< (+ (select .cse16 .cse6) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse16 .cse4) 1) v_ArrVal_1010) (not (= (select .cse14 .cse6) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse15 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| .cse2)) (< (+ (select .cse17 .cse1) 1) v_ArrVal_997) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse18 .cse6))))))))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse22 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995))) (let ((.cse27 (select .cse22 .cse6))) (let ((.cse29 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_997) .cse6 (+ .cse27 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse25 (let ((.cse30 (select .cse29 |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse28 (store (store .cse29 |c_~#queue~0.base| (store (store .cse25 .cse4 v_ArrVal_1004) .cse6 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse23 (select .cse28 |c_~#queue~0.base|))) (let ((.cse26 (store .cse23 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse24 (select (store (store .cse28 |c_~#queue~0.base| (store (store .cse26 .cse4 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse22 .cse4) 1) v_ArrVal_997) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse23 .cse6))) (not (<= v_ArrVal_1006 1)) (< (select (store .cse24 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| .cse12)) (not (= 800 (select .cse25 .cse6))) (< (+ (select .cse25 .cse4) 1) v_ArrVal_1004) (< (+ (select .cse26 .cse6) 1) v_ArrVal_1013) (= .cse27 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse24 .cse6))) (< (+ (select .cse26 .cse4) 1) v_ArrVal_1010))))))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse33 (store .cse11 (+ (* .cse12 4) |c_~#queue~0.offset|) v_ArrVal_1001))) (let ((.cse35 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse33 .cse4 v_ArrVal_1004) .cse6 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse32 (select .cse35 |c_~#queue~0.base|))) (let ((.cse34 (store .cse32 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse31 (select (store (store .cse35 |c_~#queue~0.base| (store (store .cse34 .cse4 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1006 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse31 .cse6))) (< (select (store .cse31 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse32 .cse6))) (not (= 800 (select .cse33 .cse6))) (< (+ (select .cse34 .cse4) 1) v_ArrVal_1010) (< (+ (select .cse33 .cse4) 1) v_ArrVal_1004) (< (+ (select .cse34 .cse6) 1) v_ArrVal_1013))))))))))) is different from false [2022-11-20 16:31:43,995 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse0 .cse9)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1016) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| .cse2)))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse8 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* .cse2 4)) v_ArrVal_1001))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse8 .cse1 v_ArrVal_1004) .cse9 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1006 1)) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse3 .cse6))) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1010) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1004) (not (= 800 (select .cse8 .cse9))) (< (+ (select .cse7 .cse6) 1) v_ArrVal_1013)))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse15 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4)) v_ArrVal_995))) (let ((.cse11 (select .cse15 .cse9))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse15 .cse1 v_ArrVal_997) .cse9 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse12 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_1004) .cse6 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse16 (select .cse17 |c_~#queue~0.base|))) (let ((.cse14 (store .cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse13 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (= .cse11 800) (< (+ (select .cse12 .cse4) 1) v_ArrVal_1004) (< (select (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (< (+ (select .cse14 .cse6) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse14 .cse4) 1) v_ArrVal_1010) (not (= (select .cse12 .cse6) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse13 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| .cse2)) (< (+ (select .cse15 .cse1) 1) v_ArrVal_997) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse16 .cse6)))))))))))))))) is different from false [2022-11-20 16:31:44,020 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse1 .cse6)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| .cse0)) (forall ((v_ArrVal_1016 Int)) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1016) .cse2) 2147483647)))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse5 (store .cse1 (+ (* .cse0 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1001))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse2 v_ArrVal_1004) .cse6 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1010) .cse8 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (= (select .cse5 .cse6) 800)) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1013) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse3 .cse8))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse9 .cse8))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1004)))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| .cse0)) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse15 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_88| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_995))) (let ((.cse16 (select .cse15 .cse6))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse2 v_ArrVal_997) .cse6 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse13 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_1004) .cse8 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse11 (select .cse17 |c_~#queue~0.base|))) (let ((.cse12 (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse14 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_1010) .cse8 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse11 .cse8))) (< (+ (select .cse12 .cse8) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (not (= (select .cse13 .cse8) 800)) (< (+ (select .cse12 .cse4) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse14 .cse8))) (< (+ (select .cse15 .cse2) 1) v_ArrVal_997) (= .cse16 800) (< (+ (select .cse13 .cse4) 1) v_ArrVal_1004) (< (select (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647)))))))))))))))) is different from false [2022-11-20 16:31:44,047 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse5 (store .cse9 .cse10 v_ArrVal_1001))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1004) .cse6 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1010) .cse4 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1010) (not (<= v_ArrVal_1006 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 .cse4))) (not (= (select .cse5 .cse6) 800)) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1013) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1004)))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_995 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse14 (store .cse9 .cse10 v_ArrVal_995))) (let ((.cse16 (select .cse14 .cse6))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse14 .cse7 v_ArrVal_997) .cse6 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse15 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse15 .cse1 v_ArrVal_1004) .cse4 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse12 (select .cse17 |c_~#queue~0.base|))) (let ((.cse13 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse11 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse13 .cse1 v_ArrVal_1010) .cse4 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1006 1)) (< (select (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse12 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse11 .cse4))) (< (+ (select .cse13 .cse1) 1) v_ArrVal_1010) (< (+ (select .cse14 .cse7) 1) v_ArrVal_997) (< (+ (select .cse13 .cse4) 1) v_ArrVal_1013) (not (= (select .cse15 .cse4) 800)) (= 800 .cse16) (< (+ (select .cse15 .cse1) 1) v_ArrVal_1004))))))))))) (forall ((v_ArrVal_1016 Int)) (< (select (store .cse9 .cse10 v_ArrVal_1016) .cse7) 2147483647)))) is different from false [2022-11-20 16:31:44,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse19 (select .cse9 .cse11)) (.cse0 (select .cse9 .cse10))) (let ((.cse6 (+ 1 .cse0)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse1 (= .cse19 800))) (and (< .cse0 2147483647) (or (not .cse1) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1004) .cse11 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse3))) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1010) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1013) (< .cse6 v_ArrVal_1004) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse7 .cse3)))))))))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_997) .cse11 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse14 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse3) 4)) v_ArrVal_1001)))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_1004) .cse3 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (let ((.cse12 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse13 (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_1010) .cse3 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse12 .cse5) 1) v_ArrVal_1010) (< (select (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse5) 2147483647) (< (+ (select .cse14 .cse5) 1) v_ArrVal_1004) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse12 .cse3) 1) v_ArrVal_1013) (< .cse6 v_ArrVal_997) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse15 .cse3))) (not (= (select .cse14 .cse3) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse13 .cse3))))))))))) .cse1))))) is different from false [2022-11-20 16:31:44,307 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse10 .cse12))) (let ((.cse14 (= .cse13 800)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (or (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_997) .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse3 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)) v_ArrVal_1001)))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1004) .cse5 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1010) .cse5 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1010) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1004) (< .cse4 v_ArrVal_997) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse6 .cse5))) (not (= (select .cse3 .cse5) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse2 .cse5))))))))))) .cse14) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 2147483647) (or (not .cse14) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1004) .cse12 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse17 (select .cse18 |c_~#queue~0.base|))) (let ((.cse16 (store .cse17 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse15 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse1 v_ArrVal_1010) .cse5 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse15 .cse5))) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse16 .cse1) 1) v_ArrVal_1010) (< (+ (select .cse16 .cse5) 1) v_ArrVal_1013) (< .cse4 v_ArrVal_1004) (< (select (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse17 .cse5)))))))))))))) is different from false [2022-11-20 16:31:46,732 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (select .cse9 .cse10)) (.cse12 (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse13 (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse14 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse13 .cse1))) (< (+ (select .cse14 .cse1) 1) v_ArrVal_1013) (not (<= v_ArrVal_1006 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse15 .cse1))) (< (select (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (< (+ (select .cse14 .cse3) 1) v_ArrVal_1010))))))))) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse2 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1004) (not (= (select .cse2 .cse1) 800)) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1013) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse5 .cse1))))))))))) (or (not (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) .cse12) (or (not (= .cse11 800)) .cse12)))) is different from false [2022-11-20 16:31:46,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1013) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1010)))))) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1008)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1010) .cse9 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< (+ (select .cse5 .cse6) 1) v_ArrVal_1010) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse8 .cse9))) (< (+ (select .cse5 .cse9) 1) v_ArrVal_1013) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse7 .cse1)))))))))) is different from false [2022-11-20 16:31:47,155 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ (select .cse1 .cse6) 1)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1013) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_1010) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse3 .cse5)))))) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1013) (not (<= v_ArrVal_1010 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse7 .cse5)))))) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1016 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1010) .cse6 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1013) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_1010) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse8 .cse5))))))))) is different from false [2022-11-20 16:31:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:31:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:31:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:31:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:31:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:31:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:31:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-20 16:31:47,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 16:31:47,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 16:31:47,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:31:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:31:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2066734463, now seen corresponding path program 4 times [2022-11-20 16:31:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:31:47,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099736280] [2022-11-20 16:31:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:31:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:31:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:31:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:31:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:31:53,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099736280] [2022-11-20 16:31:53,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099736280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:31:53,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120814515] [2022-11-20 16:31:53,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 16:31:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:31:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:31:53,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:31:53,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 16:31:53,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 16:31:53,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:31:53,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-20 16:31:53,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:31:54,029 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:31:54,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 16:31:54,121 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 16:31:54,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:31:54,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:31:54,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:31:55,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:31:55,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:31:55,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:31:55,737 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:31:55,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:31:55,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:55,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:31:56,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:31:56,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:56,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:31:56,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:31:56,739 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:31:56,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:31:56,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:56,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:31:57,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:31:57,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:57,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:31:57,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:31:57,943 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:31:57,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:31:58,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:58,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:31:58,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:31:58,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:58,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:31:59,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:31:59,036 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:31:59,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:31:59,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:59,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:31:59,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 16:31:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:31:59,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:31:59,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 Int) (v_ArrVal_1152 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1))))) is different from false [2022-11-20 16:31:59,736 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 Int) (v_ArrVal_1152 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1154)) .cse1))))) is different from false [2022-11-20 16:31:59,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1149) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1154)) .cse1))))) is different from false [2022-11-20 16:31:59,923 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1147)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1149) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1)) 800))) is different from false [2022-11-20 16:31:59,941 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (forall ((v_ArrVal_1154 Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int))) (not (= 800 (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1147))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1149) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1154)) .cse3)))))))) is different from false [2022-11-20 16:31:59,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1149) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1154)) .cse3)) 800))))) is different from false [2022-11-20 16:32:01,481 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse5 .cse6))) (or (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1141) .cse6 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1149) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse4 .cse1))))))) (= .cse7 800)))) is different from false [2022-11-20 16:32:01,596 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1139)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse6 .cse7))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1141) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1149) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse4 .cse1))) (= 800 .cse5))))))) is different from false [2022-11-20 16:32:01,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse0 .cse1))) (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1139))) (let ((.cse7 (select .cse8 .cse1))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1141) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse2 .cse3))) (not (= 800 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1149) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_1154)) .cse3))) (= 800 .cse7)))))))))) is different from false [2022-11-20 16:32:01,693 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4)) v_ArrVal_1139)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (select .cse8 .cse7))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1141) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1149) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1154)) .cse1) 800)) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse6 .cse7)))))))))) is different from false [2022-11-20 16:32:03,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1154 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1138))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1139)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse9 .cse1))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1141) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (= .cse2 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse3 .cse1))) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse6 .cse7 v_ArrVal_1149) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1) 800)))))))))) is different from false [2022-11-20 16:32:04,289 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1134 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1133 Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1139 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1133)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1134) .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1138))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1139)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1141) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (or (= .cse0 800) (not (= 800 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse4 .cse5 v_ArrVal_1149) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse6 .cse2))))))))))) is different from false [2022-11-20 16:32:04,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1134 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1133 Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1139 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse12 (+ (* (select .cse12 .cse11) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1133)))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1134) .cse11 (+ (select .cse10 .cse11) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1138))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1139)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse9 .cse1))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1141) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse2 .cse1))) (= .cse3 800) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse6 .cse7 v_ArrVal_1149) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1) 800)))))))))) is different from false [2022-11-20 16:32:06,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1130 (Array Int Int)) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1134 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1133 Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1139 Int)) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1130) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1131))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1133)))) (store (store .cse11 .cse7 v_ArrVal_1134) .cse1 (+ (select .cse11 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1138))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1139))) (let ((.cse3 (select .cse9 .cse1))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1141) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse2 .cse1))) (= 800 .cse3) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse6 .cse7 v_ArrVal_1149) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_1154)) .cse1) 800))))))))))) is different from false [2022-11-20 16:32:07,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:32:07,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 4031 treesize of output 2326 [2022-11-20 16:32:08,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:32:08,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8546 treesize of output 8416 [2022-11-20 16:32:08,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8306 treesize of output 8114 [2022-11-20 16:32:08,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6896 treesize of output 6512 [2022-11-20 16:32:08,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8760 treesize of output 8536 [2022-11-20 16:32:08,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7997 treesize of output 7741 [2022-11-20 16:32:08,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9272 treesize of output 9080 [2022-11-20 16:32:09,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:32:13,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:32:13,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1069 treesize of output 945 [2022-11-20 16:32:14,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:32:14,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 114 [2022-11-20 16:32:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 108 refuted. 9 times theorem prover too weak. 0 trivial. 72 not checked. [2022-11-20 16:32:15,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120814515] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:32:15,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:32:15,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 47] total 119 [2022-11-20 16:32:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540702854] [2022-11-20 16:32:15,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:32:15,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2022-11-20 16:32:15,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:32:15,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2022-11-20 16:32:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1418, Invalid=9397, Unknown=161, NotChecked=3066, Total=14042 [2022-11-20 16:32:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:32:15,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:32:15,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 5.5966386554621845) internal successors, (666), 119 states have internal predecessors, (666), 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-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:32:15,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-20 16:32:15,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:32:41,657 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse16 .cse17 (+ (select .cse16 .cse17) 1)))))) (and (forall ((v_ArrVal_1154 Int) (v_ArrVal_1152 (Array Int Int))) (not (= 800 (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1)))) (forall ((v_ArrVal_1141 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1154 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse10 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1138))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1139))) (let ((.cse9 (select .cse11 .cse1))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_1141) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (or (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse5 .cse6 v_ArrVal_1149) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1154)) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse8 .cse1))) (= .cse9 800))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1154 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse14 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1145))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse12 .cse1))) (not (= 800 (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1147))) (store (store .cse15 .cse6 v_ArrVal_1149) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) v_ArrVal_1154)) .cse1))))))))) is different from false [2022-11-20 16:32:41,679 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 (+ (select .cse9 .cse10) 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse2 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1001)))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1004) (not (= (select .cse2 .cse1) 800)) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1013) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1010) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse5 .cse1))))))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1001 Int) (v_ArrVal_1004 Int) (v_ArrVal_1006 Int) (v_ArrVal_1016 Int) (v_ArrVal_1008 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1000))) (let ((.cse12 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse1) 4)) v_ArrVal_1001)))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse3 v_ArrVal_1004) .cse1 v_ArrVal_1006)) |c_~#stored_elements~0.base| v_ArrVal_1007))) (let ((.cse11 (select .cse15 |c_~#queue~0.base|))) (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_1008))) (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse3 v_ArrVal_1010) .cse1 v_ArrVal_1013)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse11 .cse1))) (< (+ (select .cse12 .cse3) 1) v_ArrVal_1004) (not (<= v_ArrVal_1006 1)) (< (+ (select .cse13 .cse1) 1) v_ArrVal_1013) (not (= 800 (select .cse12 .cse1))) (< (select (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1016) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse14 .cse1))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_1010))))))))))) is different from false [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:32:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-20 16:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-11-20 16:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-20 16:32:43,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 16:32:43,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 16:32:43,320 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:32:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:32:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1117238928, now seen corresponding path program 2 times [2022-11-20 16:32:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:32:43,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911032576] [2022-11-20 16:32:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:32:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:32:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:32:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:32:48,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:32:48,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911032576] [2022-11-20 16:32:48,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911032576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:32:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542900337] [2022-11-20 16:32:48,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:32:48,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:32:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:32:48,372 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:32:48,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68e78573-f0b5-4492-95fe-06387b84ebd4/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 16:32:48,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:32:48,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:32:48,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 130 conjunts are in the unsatisfiable core [2022-11-20 16:32:48,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:32:48,821 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:32:48,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 16:32:48,887 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:32:48,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:32:49,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:32:49,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:32:49,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:32:49,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:32:50,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:32:50,469 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:32:50,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:32:50,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:32:50,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:32:51,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:32:51,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:32:51,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:32:51,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:32:51,659 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:32:51,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:32:51,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:32:51,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:32:52,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:32:52,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:32:52,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:32:52,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:32:52,670 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:32:52,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:32:52,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:32:52,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:32:53,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:32:53,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:32:53,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:32:53,597 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:32:53,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:32:53,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:32:53,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 16:32:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:32:53,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:32:54,096 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1281)) .cse1)) 2147483647)) is different from false [2022-11-20 16:32:54,482 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse1)) 2147483647))) is different from false [2022-11-20 16:32:54,493 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse1)) 2147483647)) (= .cse4 800)))) is different from false [2022-11-20 16:32:54,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1276 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1276) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1281)) .cse1)) 2147483647)) (= .cse4 800)))) is different from false [2022-11-20 16:32:54,577 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1274)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1276) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse2)) 2147483647))))) is different from false [2022-11-20 16:32:54,594 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int)) (let ((.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1274)))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1276) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1281)) .cse2)) 2147483647)))))) is different from false [2022-11-20 16:32:54,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int)) (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse5 .cse4) 4)) v_ArrVal_1274)))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1276) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1281)) .cse2)) 2147483647)))))) is different from false [2022-11-20 16:32:55,492 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1276) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse1) 2147483647) (= 800 .cse4)))))) is different from false [2022-11-20 16:32:55,524 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1276) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse1) 2147483647) (= 800 .cse4)))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) is different from false [2022-11-20 16:32:55,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 800) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1270) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1276) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1281)) .cse3) 2147483647))))))))) is different from false [2022-11-20 16:32:55,882 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1267)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse7 .cse8))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1270) .cse8 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_1274)))) (let ((.cse0 (select .cse5 .cse3))) (or (= 800 .cse0) (= 800 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1276) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse3) 2147483647)))))))) is different from false [2022-11-20 16:32:55,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1267)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1270) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1276) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_1281)) .cse2) 2147483647) (= .cse5 800))))))))) is different from false [2022-11-20 16:32:55,965 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse9 .cse8) 4)) v_ArrVal_1267)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1270) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1276) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse1) 2147483647) (= .cse4 800) (= .cse5 800))))))))) is different from false [2022-11-20 16:32:56,433 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1267)))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1270) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1274)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1276) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse1) 2147483647) (= .cse5 800) (= .cse6 800))))))))) is different from false [2022-11-20 16:32:56,589 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_1267)))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1270) .cse3 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_1274)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 800 .cse0) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1276) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse3) 2147483647))))))))) is different from false [2022-11-20 16:32:56,660 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1267)))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1270) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse6 (select .cse4 .cse2))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1276) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1281)) .cse2) 2147483647) (= .cse6 800))))))))) is different from false [2022-11-20 16:32:56,689 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1267)))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1270) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1274)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1276) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1281)) .cse1) 2147483647) (= .cse5 800) (= 800 .cse6))))))))) is different from false [2022-11-20 16:32:56,740 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1267)))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1270) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1274)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1276) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1281)) .cse1) 2147483647) (= .cse5 800) (= 800 .cse6))))))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) is different from false [2022-11-20 16:32:57,051 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse11 .cse12))) (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1263 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1263) .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1267)))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1270) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse6 (select .cse4 .cse2))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1276) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse2) 2147483647) (= .cse6 800))))))))) (= .cse13 800)))) is different from false [2022-11-20 16:32:57,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1261)) (.cse13 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse12 .cse13))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1263) .cse13 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_1267)))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1270) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_1274)))) (let ((.cse6 (select .cse4 .cse2))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1276) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse2) 2147483647) (= 800 .cse7) (= .cse6 800))))))))))) is different from false [2022-11-20 16:32:57,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse13 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse14 (+ (* (select .cse14 .cse13) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1261)))) (let ((.cse7 (select .cse12 .cse13))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1263) .cse13 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse2))) v_ArrVal_1267)))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1270) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_1274)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 800) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1276) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1281)) .cse2) 2147483647) (= .cse6 800) (= .cse7 800)))))))))))) is different from false [2022-11-20 16:32:57,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse13 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse12 (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse14 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse14 .cse13) 4)) v_ArrVal_1261)))) (let ((.cse7 (select .cse12 .cse13))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1263) .cse13 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1267)))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1270) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1276) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1281)) .cse2) 2147483647) (= 800 .cse6) (= 800 .cse7)))))))))))) is different from false [2022-11-20 16:32:58,881 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1267 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1259))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1261)))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (select .cse13 .cse4))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_1263) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)) v_ArrVal_1267)))) (let ((.cse2 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_1270) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse0 (select .cse6 .cse4))) (or (= 800 .cse0) (= .cse1 800) (= 800 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1276) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_1281)) .cse4) 2147483647)))))))))))) is different from false [2022-11-20 16:32:59,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1270 Int) (v_ArrVal_1281 Int) (v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (v_ArrVal_1274 Int) (v_ArrVal_1276 Int) (v_ArrVal_1257 Int) (v_ArrVal_1267 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1257)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1259))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1261)))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select .cse13 .cse3))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_1263) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1267)))) (let ((.cse0 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_1270) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1273))) (let ((.cse5 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1274)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 800 .cse0) (= 800 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1276) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1280) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1281)) .cse3) 2147483647) (= 800 .cse7)))))))))))) is different from false [2022-11-20 16:32:59,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:32:59,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 10593 treesize of output 5933 [2022-11-20 16:32:59,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:32:59,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6807 treesize of output 6653 [2022-11-20 16:32:59,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4910 treesize of output 4718 [2022-11-20 16:32:59,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6315 treesize of output 6059 [2022-11-20 16:32:59,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5847 treesize of output 5655 [2022-11-20 16:32:59,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5390 treesize of output 5150 [2022-11-20 16:33:00,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3208 treesize of output 2728 [2022-11-20 16:33:00,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:33:00,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:33:00,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2474 treesize of output 2334