./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:41:57,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:41:57,852 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2023-12-02 20:41:57,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:41:57,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:41:57,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:41:57,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:41:57,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:41:57,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:41:57,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:41:57,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:41:57,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:41:57,885 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:41:57,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:41:57,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:41:57,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:41:57,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:41:57,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:41:57,888 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 20:41:57,889 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 20:41:57,889 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 20:41:57,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:41:57,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 20:41:57,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:41:57,891 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:41:57,891 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:41:57,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:41:57,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:41:57,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:41:57,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:41:57,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:41:57,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:41:57,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:41:57,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:41:57,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:41:57,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:41:57,895 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:41:57,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:41:57,895 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:41:57,896 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:41:57,896 INFO L153 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_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/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_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-12-02 20:41:58,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:41:58,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:41:58,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:41:58,126 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:41:58,127 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:41:58,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:42:00,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:42:01,070 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:42:01,070 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:42:01,087 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data/52038ed61/fdf51ce6d0374e0c9476854811a4e1ee/FLAGaa53b7e99 [2023-12-02 20:42:01,101 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data/52038ed61/fdf51ce6d0374e0c9476854811a4e1ee [2023-12-02 20:42:01,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:42:01,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:42:01,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:42:01,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:42:01,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:42:01,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4755e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01, skipping insertion in model container [2023-12-02 20:42:01,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:42:01,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:42:01,550 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:42:01,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:42:01,681 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:42:01,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01 WrapperNode [2023-12-02 20:42:01,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:42:01,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:42:01,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:42:01,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:42:01,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,742 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-12-02 20:42:01,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:42:01,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:42:01,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:42:01,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:42:01,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:42:01,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:42:01,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:42:01,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:42:01,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (1/1) ... [2023-12-02 20:42:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:42:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:42:01,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:42:01,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:42:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 20:42:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 20:42:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 20:42:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 20:42:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:42:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:42:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:42:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:42:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:42:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:42:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:42:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:42:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:42:01,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:42:01,879 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:42:02,034 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:42:02,036 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:42:02,429 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:42:02,581 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:42:02,581 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:42:02,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:02 BoogieIcfgContainer [2023-12-02 20:42:02,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:42:02,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:42:02,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:42:02,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:42:02,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:42:01" (1/3) ... [2023-12-02 20:42:02,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebb3823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:42:02, skipping insertion in model container [2023-12-02 20:42:02,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:01" (2/3) ... [2023-12-02 20:42:02,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebb3823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:42:02, skipping insertion in model container [2023-12-02 20:42:02,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:02" (3/3) ... [2023-12-02 20:42:02,590 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-12-02 20:42:02,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:42:02,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-12-02 20:42:02,605 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:42:02,694 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 20:42:02,733 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:42:02,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:42:02,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:42:02,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:42:02,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:42:02,783 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:42:02,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-12-02 20:42:02,802 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6fd40c93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:42:02,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-12-02 20:42:03,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:03,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1823131261, now seen corresponding path program 1 times [2023-12-02 20:42:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928186029] [2023-12-02 20:42:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928186029] [2023-12-02 20:42:03,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928186029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:42:03,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:42:03,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:42:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495342127] [2023-12-02 20:42:03,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:42:03,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:42:03,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:03,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:42:03,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:42:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:03,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:03,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:03,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:03,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:42:03,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:03,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1823131262, now seen corresponding path program 1 times [2023-12-02 20:42:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:03,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167132259] [2023-12-02 20:42:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:03,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:04,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:04,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167132259] [2023-12-02 20:42:04,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167132259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:42:04,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:42:04,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 20:42:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418925848] [2023-12-02 20:42:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:42:04,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:42:04,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:42:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 20:42:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:04,422 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:04,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:04,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:04,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:42:04,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:04,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1790474273, now seen corresponding path program 1 times [2023-12-02 20:42:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825071983] [2023-12-02 20:42:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825071983] [2023-12-02 20:42:05,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825071983] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:42:05,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:42:05,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 20:42:05,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113535683] [2023-12-02 20:42:05,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:42:05,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 20:42:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:05,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 20:42:05,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 20:42:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:05,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:05,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:05,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:05,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:05,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:06,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:42:06,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:06,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -328796434, now seen corresponding path program 1 times [2023-12-02 20:42:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166726826] [2023-12-02 20:42:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166726826] [2023-12-02 20:42:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166726826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:42:06,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:42:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:42:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129398397] [2023-12-02 20:42:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:42:06,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:42:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:42:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:42:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:06,271 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:06,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:06,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:06,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:06,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 20:42:06,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:06,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash -328796433, now seen corresponding path program 1 times [2023-12-02 20:42:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135271187] [2023-12-02 20:42:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:06,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:06,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135271187] [2023-12-02 20:42:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135271187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:42:06,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:42:06,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:42:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792483569] [2023-12-02 20:42:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:42:06,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:42:06,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:06,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:42:06,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:42:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:06,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:06,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:06,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:06,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:06,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 20:42:06,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:06,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1646577762, now seen corresponding path program 1 times [2023-12-02 20:42:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:06,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396537183] [2023-12-02 20:42:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:09,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:09,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396537183] [2023-12-02 20:42:09,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396537183] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:42:09,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366644740] [2023-12-02 20:42:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:09,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:09,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:42:09,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:42:09,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:42:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:09,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-02 20:42:09,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:42:09,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:42:09,385 INFO L378 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 [2023-12-02 20:42:09,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:42:09,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:42:09,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:09,757 INFO L378 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 16 [2023-12-02 20:42:10,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:10,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:10,238 INFO L378 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 26 treesize of output 21 [2023-12-02 20:42:10,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:10,323 INFO L378 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 16 [2023-12-02 20:42:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:10,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:42:12,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:12,342 INFO L378 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 260 treesize of output 264 [2023-12-02 20:42:12,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:12,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 47 [2023-12-02 20:42:13,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:13,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 54 treesize of output 36 [2023-12-02 20:42:13,007 INFO L378 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 12 treesize of output 8 [2023-12-02 20:42:13,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:13,022 INFO L378 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 3 case distinctions, treesize of input 159 treesize of output 109 [2023-12-02 20:42:13,028 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 135 [2023-12-02 20:42:13,040 INFO L378 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 73 treesize of output 65 [2023-12-02 20:42:13,052 INFO L378 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 104 treesize of output 96 [2023-12-02 20:42:13,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:13,079 INFO L378 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 87 treesize of output 89 [2023-12-02 20:42:13,334 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-12-02 20:42:13,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 20:42:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:13,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366644740] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:42:13,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:42:13,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 39 [2023-12-02 20:42:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243062584] [2023-12-02 20:42:13,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:42:13,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 20:42:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:13,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 20:42:13,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1383, Unknown=57, NotChecked=0, Total=1640 [2023-12-02 20:42:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:13,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:13,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:13,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:13,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:13,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:13,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:13,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:13,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:42:17,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:42:17,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:17,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:17,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1648931394, now seen corresponding path program 1 times [2023-12-02 20:42:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744726441] [2023-12-02 20:42:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744726441] [2023-12-02 20:42:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744726441] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:42:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521562354] [2023-12-02 20:42:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:19,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:42:19,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:42:19,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:42:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:19,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-02 20:42:19,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:42:19,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:42:19,292 INFO L378 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 [2023-12-02 20:42:19,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:42:19,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:42:19,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:19,566 INFO L378 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 16 [2023-12-02 20:42:19,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:19,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:19,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-02 20:42:19,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:19,895 INFO L378 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 26 treesize of output 21 [2023-12-02 20:42:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:19,937 INFO L378 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 16 [2023-12-02 20:42:20,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:20,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-02 20:42:20,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:20,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:42:20,409 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_245 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1)))))) is different from false [2023-12-02 20:42:20,442 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_245 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1)))))) is different from false [2023-12-02 20:42:20,469 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_16| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_245 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_16|) .cse1)))))) is different from false [2023-12-02 20:42:20,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_16| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_245 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_16|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))) is different from false [2023-12-02 20:42:20,680 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_16| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_240 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_245 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_240))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_16|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))))) is different from false [2023-12-02 20:42:20,766 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_16| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_240 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_245 (Array Int Int)) (v_ArrVal_238 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_238)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_240))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_16|) .cse1) 400))))))) is different from false [2023-12-02 20:42:20,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_16| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_240 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_245 (Array Int Int)) (v_ArrVal_238 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) 0) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_238)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_240))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_16|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))))) is different from false [2023-12-02 20:42:20,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:20,817 INFO L378 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 3 case distinctions, treesize of input 281 treesize of output 171 [2023-12-02 20:42:20,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:20,831 INFO L378 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 281 treesize of output 277 [2023-12-02 20:42:20,848 INFO L378 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 204 treesize of output 192 [2023-12-02 20:42:20,860 INFO L378 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 237 treesize of output 221 [2023-12-02 20:42:20,909 INFO L378 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 [2023-12-02 20:42:21,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:21,150 INFO L378 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 112 treesize of output 110 [2023-12-02 20:42:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 20:42:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521562354] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:42:21,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:42:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 45 [2023-12-02 20:42:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177722323] [2023-12-02 20:42:21,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:42:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 20:42:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 20:42:21,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1234, Unknown=16, NotChecked=560, Total=2070 [2023-12-02 20:42:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:21,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:21,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.152173913043478) internal successors, (99), 45 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) [2023-12-02 20:42:21,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:21,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:21,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:21,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:21,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:21,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:42:21,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:22,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3)))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))) (not (= (select .cse2 1604) 400)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_245 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))))) is different from false [2023-12-02 20:42:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:42:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:42:23,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:42:23,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:23,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:23,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash 423810259, now seen corresponding path program 1 times [2023-12-02 20:42:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988794801] [2023-12-02 20:42:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988794801] [2023-12-02 20:42:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988794801] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:42:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919632761] [2023-12-02 20:42:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:42:23,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:42:23,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:42:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:23,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 20:42:23,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:42:23,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:23,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:23,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-12-02 20:42:23,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:23,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:42:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:24,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:42:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919632761] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:42:24,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:42:24,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-12-02 20:42:24,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489786992] [2023-12-02 20:42:24,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:42:24,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:42:24,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:24,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:42:24,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:42:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:24,297 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:24,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:42:24,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:24,570 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3)))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_245 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_245) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))))) is different from false [2023-12-02 20:42:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:42:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:42:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:42:24,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:42:24,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:24,999 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:24,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1621529241, now seen corresponding path program 1 times [2023-12-02 20:42:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:24,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554748129] [2023-12-02 20:42:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 20:42:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554748129] [2023-12-02 20:42:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554748129] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:42:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276848295] [2023-12-02 20:42:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:42:25,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:42:25,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:42:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:25,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 20:42:25,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:42:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 20:42:25,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:42:25,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:42:25,729 INFO L378 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 15 treesize of output 19 [2023-12-02 20:42:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 20:42:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276848295] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:42:25,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:42:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-12-02 20:42:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201669974] [2023-12-02 20:42:25,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:42:25,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 20:42:25,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:25,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 20:42:25,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-02 20:42:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:25,772 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:25,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:42:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:42:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:42:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:42:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:42:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:42:26,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:42:26,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:26,537 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:42:26,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:42:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash 738668258, now seen corresponding path program 2 times [2023-12-02 20:42:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:42:26,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222679776] [2023-12-02 20:42:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:42:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:42:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:42:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:28,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:42:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222679776] [2023-12-02 20:42:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222679776] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:42:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494946712] [2023-12-02 20:42:28,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:42:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:42:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:42:28,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:42:28,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:42:28,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:42:28,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:42:28,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 20:42:28,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:42:29,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:42:29,002 INFO L378 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 [2023-12-02 20:42:29,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:42:29,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:42:29,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:29,270 INFO L378 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 16 [2023-12-02 20:42:29,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:29,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:29,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-02 20:42:29,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:29,603 INFO L378 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 30 treesize of output 14 [2023-12-02 20:42:29,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:29,650 INFO L378 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 16 [2023-12-02 20:42:29,806 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-02 20:42:29,807 INFO L378 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 41 treesize of output 24 [2023-12-02 20:42:29,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:42:30,015 INFO L378 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 23 [2023-12-02 20:42:30,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:30,076 INFO L378 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 16 [2023-12-02 20:42:30,235 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-02 20:42:30,236 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2023-12-02 20:42:30,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2023-12-02 20:42:30,520 INFO L378 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 39 treesize of output 26 [2023-12-02 20:42:30,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:42:30,584 INFO L378 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 30 treesize of output 21 [2023-12-02 20:42:30,702 INFO L378 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 29 treesize of output 13 [2023-12-02 20:42:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:42:30,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:42:30,798 INFO L378 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 38 treesize of output 34 [2023-12-02 20:42:30,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_488 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 401)))) is different from false [2023-12-02 20:42:31,015 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse1) 401)) (forall ((v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-02 20:42:31,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store .cse4 .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse3 (select .cse0 .cse2))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse2) 401)) (= 400 .cse3))))) (< .cse5 0))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse9 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store .cse8 .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse7 (select .cse6 .cse2))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (= 400 .cse7))))) (< .cse9 0))))))) is different from false [2023-12-02 20:42:32,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse6 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store .cse6 .cse0 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse5 (select .cse2 .cse4))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 401)) (= 400 .cse5))))))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse10 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse7 0) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (store .cse10 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse8 (select .cse9 .cse4))) (or (= 400 .cse8) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse9 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))))))))))))) is different from false [2023-12-02 20:42:32,096 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse5 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store .cse5 .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (select .cse1 .cse3))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (= 400 .cse4))))) (< .cse6 0))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse9 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse10 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (store .cse9 .cse10 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse7 (select .cse8 .cse3))) (or (= 400 .cse7) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse8 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse3) 401)))))) (< .cse10 0))))))) is different from false [2023-12-02 20:43:05,506 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse8 (select .cse7 .cse1))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)))) (or (forall ((v_subst_4 Int)) (let ((.cse3 (store .cse5 .cse6 v_subst_4))) (let ((.cse2 (select .cse3 .cse1))) (or (= 400 .cse2) (forall ((v_subst_1 Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (< .cse6 0))))) (= 400 .cse8)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse14 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse15 (select .cse14 .cse1))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse13 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)))) (or (forall ((v_subst_3 Int)) (let ((.cse10 (store .cse12 .cse13 v_subst_3))) (let ((.cse11 (select .cse10 .cse1))) (or (forall ((v_subst_2 Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse4 (+ v_subst_2 1)) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse1) 401)) (= 400 .cse11))))) (< .cse13 0))))) (= 400 .cse15)))))))))) is different from false [2023-12-02 20:43:20,214 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604)) (.cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse14 (select .cse13 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| 1))))) (let ((.cse11 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (forall ((v_subst_7 Int)) (let ((.cse10 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_subst_7))) (let ((.cse2 (select .cse10 .cse7))) (or (= 400 .cse2) (forall ((v_subst_6 Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse9 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse10 .cse6 (+ v_subst_6 1)) .cse7 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse3 (+ |c_~#queue~0.offset| (* (select .cse9 .cse7) 4)))) (or (< .cse3 0) (forall ((v_subst_3 Int)) (let ((.cse5 (store .cse9 .cse3 v_subst_3))) (let ((.cse8 (select .cse5 .cse7))) (or (forall ((v_subst_2 Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ v_subst_2 1)) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse7) 401)) (= 400 .cse8))))))))))))) (< (select .cse11 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|)))))))) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse15 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse15 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| 1))))) (let ((.cse16 (select (store .cse18 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (< (select .cse16 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((v_subst_8 Int)) (let ((.cse23 (store .cse16 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_subst_8))) (let ((.cse17 (select .cse23 .cse7))) (or (= .cse17 400) (forall ((v_subst_5 Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse21 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse23 .cse6 (+ v_subst_5 1)) .cse7 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse22 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|))) (or (forall ((v_subst_4 Int)) (let ((.cse19 (store .cse21 .cse22 v_subst_4))) (let ((.cse20 (select .cse19 .cse7))) (or (forall ((v_subst_1 Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 (+ v_subst_1 1)) .cse7 (+ .cse20 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse7))))) (= 400 .cse20))))) (< .cse22 0)))))))))))))))) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|)))))) is different from false [2023-12-02 20:43:54,021 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_476 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_476))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| 1))) |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((v_subst_8 Int)) (let ((.cse11 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_subst_8))) (let ((.cse4 (select .cse11 .cse1))) (or (= .cse4 400) (forall ((v_subst_5 Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ v_subst_5 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (or (< .cse5 0) (forall ((v_subst_4 Int)) (let ((.cse8 (store .cse10 .cse5 v_subst_4))) (let ((.cse6 (select .cse8 .cse1))) (or (= 400 .cse6) (forall ((v_subst_1 Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 (+ v_subst_1 1)) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse1))))))))))))))))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_476 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_476))) (let ((.cse12 (select .cse15 |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| 1))) |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((v_subst_7 Int)) (let ((.cse20 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_subst_7))) (let ((.cse21 (select .cse20 .cse1))) (or (forall ((v_subst_6 Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse18 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse20 .cse9 (+ v_subst_6 1)) .cse1 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse19 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|))) (or (forall ((v_subst_3 Int)) (let ((.cse16 (store .cse18 .cse19 v_subst_3))) (let ((.cse17 (select .cse16 .cse1))) (or (forall ((v_subst_2 Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse9 (+ v_subst_2 1)) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse1) 401)) (= 400 .cse17))))) (< .cse19 0))))) (= 400 .cse21))))))))))))))))) is different from false [2023-12-02 20:44:17,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:17,293 INFO L378 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 3 case distinctions, treesize of input 1877 treesize of output 1067 [2023-12-02 20:44:17,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:17,323 INFO L378 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 1648 treesize of output 1632 [2023-12-02 20:44:17,358 INFO L378 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 320 treesize of output 312 [2023-12-02 20:44:17,385 INFO L378 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 367 treesize of output 335 [2023-12-02 20:44:17,424 INFO L378 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 178 treesize of output 162 [2023-12-02 20:44:17,453 INFO L378 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 234 treesize of output 226 [2023-12-02 20:44:17,511 INFO L378 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 [2023-12-02 20:44:17,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:17,745 INFO L378 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 65 treesize of output 67 [2023-12-02 20:44:17,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:17,802 INFO L378 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 3 case distinctions, treesize of input 1873 treesize of output 1063 [2023-12-02 20:44:17,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:44:17,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:17,821 INFO L378 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 1 case distinctions, treesize of input 734 treesize of output 718 [2023-12-02 20:44:17,842 INFO L378 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 184 treesize of output 176 [2023-12-02 20:44:17,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:17,879 INFO L378 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 [2023-12-02 20:44:17,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:17,958 INFO L378 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 237 treesize of output 239 [2023-12-02 20:44:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 10 times theorem prover too weak. 0 trivial. 14 not checked. [2023-12-02 20:44:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494946712] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:44:18,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:44:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 32] total 77 [2023-12-02 20:44:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525507590] [2023-12-02 20:44:18,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:44:18,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-12-02 20:44:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:44:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-12-02 20:44:18,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=4177, Unknown=229, NotChecked=1160, Total=6162 [2023-12-02 20:44:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:18,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:44:18,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 1.9230769230769231) internal successors, (150), 78 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:44:18,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:44:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:44:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:44:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:44:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 20:44:33,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:44:33,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:33,398 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:44:33,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:44:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash -374653660, now seen corresponding path program 2 times [2023-12-02 20:44:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:44:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692480908] [2023-12-02 20:44:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:44:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:44:35,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:44:35,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692480908] [2023-12-02 20:44:35,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692480908] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:44:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900697297] [2023-12-02 20:44:35,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:44:35,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:35,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:44:35,527 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:44:35,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 20:44:35,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:44:35,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:44:35,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 20:44:35,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:44:35,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:35,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:44:35,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:35,729 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 20:44:35,729 INFO L378 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 1 [2023-12-02 20:44:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:44:36,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:44:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900697297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:44:36,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:44:36,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 30 [2023-12-02 20:44:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121284055] [2023-12-02 20:44:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:44:36,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:44:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:44:36,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:44:36,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2023-12-02 20:44:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:36,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:44:36,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-12-02 20:44:36,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:44:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:44:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:44:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:44:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 20:44:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:44:37,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 20:44:37,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:37,650 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:44:37,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:44:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2109014089, now seen corresponding path program 1 times [2023-12-02 20:44:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:44:37,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945959903] [2023-12-02 20:44:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:44:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 43 proven. 65 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-12-02 20:44:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:44:39,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945959903] [2023-12-02 20:44:39,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945959903] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:44:39,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38012937] [2023-12-02 20:44:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:39,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:44:39,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:44:39,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:44:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:39,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 20:44:39,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:44:39,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:44:39,216 INFO L378 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 [2023-12-02 20:44:39,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:44:39,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:44:39,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:44:39,452 INFO L378 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 16 [2023-12-02 20:44:39,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:39,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:39,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-02 20:44:39,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:44:39,737 INFO L378 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 26 treesize of output 21 [2023-12-02 20:44:39,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:39,783 INFO L378 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 16 [2023-12-02 20:44:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:39,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:39,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-02 20:44:39,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:44:40,019 INFO L378 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 26 treesize of output 21 [2023-12-02 20:44:40,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:40,075 INFO L378 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 16 [2023-12-02 20:44:40,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:40,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:40,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-02 20:44:40,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:44:40,325 INFO L378 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 26 treesize of output 21 [2023-12-02 20:44:40,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:40,375 INFO L378 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 16 [2023-12-02 20:44:40,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:44:40,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:44:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-02 20:44:40,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:44:40,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-02 20:44:40,766 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-02 20:44:40,774 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-02 20:44:40,791 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-02 20:44:40,808 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))))) is different from false [2023-12-02 20:44:40,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))) is different from false [2023-12-02 20:44:41,072 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|))))) is different from false [2023-12-02 20:44:41,272 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (v_ArrVal_769 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))))))) is different from false [2023-12-02 20:44:41,302 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (v_ArrVal_769 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_773 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))))))) is different from false [2023-12-02 20:44:41,332 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (v_ArrVal_769 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_773 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))) is different from false [2023-12-02 20:44:42,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (v_ArrVal_769 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_773 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1) 400)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))))) is different from false [2023-12-02 20:44:42,244 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_54|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1)))))))) is different from false [2023-12-02 20:44:42,284 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (v_ArrVal_773 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_54|))) (store (store .cse7 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))))) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) is different from false [2023-12-02 20:44:42,744 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_761))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse9 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse9 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_54|))) (store (store .cse8 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| 1)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|))))))) is different from false [2023-12-02 20:44:42,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (v_ArrVal_759 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_759)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_761))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_54|))) (store (store .cse8 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| 1)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))))))) is different from false [2023-12-02 20:44:42,937 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (v_ArrVal_759 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) 0) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_759)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_761))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse9 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse9 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_54|))) (store (store .cse8 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_80| 1)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (store (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_76| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_773) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_48|)) .cse1) 400)))))))) is different from false [2023-12-02 20:44:42,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:42,961 INFO L378 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 3 case distinctions, treesize of input 1750 treesize of output 960 [2023-12-02 20:44:42,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:42,982 INFO L378 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 1305 treesize of output 1287 [2023-12-02 20:44:43,026 INFO L378 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 583 treesize of output 559 [2023-12-02 20:44:43,047 INFO L378 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 459 treesize of output 447 [2023-12-02 20:44:43,074 INFO L378 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 84 treesize of output 76 [2023-12-02 20:44:43,097 INFO L378 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 131 treesize of output 123 [2023-12-02 20:44:43,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:43,302 INFO L378 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 [2023-12-02 20:44:43,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:43,738 INFO L378 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 334 treesize of output 320 [2023-12-02 20:44:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 39 not checked. [2023-12-02 20:44:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38012937] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:44:44,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:44:44,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 31] total 63 [2023-12-02 20:44:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956233563] [2023-12-02 20:44:44,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:44:44,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-02 20:44:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:44:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-02 20:44:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1911, Unknown=54, NotChecked=1712, Total=4032 [2023-12-02 20:44:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:44,123 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:44:44,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.734375) internal successors, (175), 63 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:44:44,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:05,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:17,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:27,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:29,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:40,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:42,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:44,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:47,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:49,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:45:54,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:46:01,679 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse15 (select .cse16 .cse17))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ .cse15 1)))) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (and (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse7) 401)) (forall ((v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))))) (.cse2 (= 400 .cse15)) (.cse3 (let ((.cse6 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse10 (+ |c_~#queue~0.offset| (* (select .cse9 .cse7) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store .cse9 .cse10 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse8 (select .cse5 .cse7))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse7)) |c_~#queue~0.offset|))) (= 400 .cse8))))) (< .cse10 0))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse13 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse14 (+ |c_~#queue~0.offset| (* (select .cse13 .cse7) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (store .cse13 .cse14 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse11 (select .cse12 .cse7))) (or (= 400 .cse11) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse12 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse7) 401)))))) (< .cse14 0)))))))) (.cse1 (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|))) (and (or .cse0 .cse1) (or .cse0 .cse2) (or .cse2 .cse3) (or .cse3 .cse1)))))) is different from false [2023-12-02 20:46:03,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse16 (select .cse14 .cse15))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse14 .cse15 (+ .cse16 1)))) (.cse9 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (and (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse9) 401)) (forall ((v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse9) 4) |c_~#queue~0.offset|))))) (.cse2 (= 400 .cse16)) (.cse3 (and (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse28 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse29 (+ |c_~#queue~0.offset| (* (select .cse28 .cse9) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse26 (store .cse28 .cse29 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse27 (select .cse26 .cse9))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse27 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse9)) |c_~#queue~0.offset|))) (= 400 .cse27))))) (< .cse29 0))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse32 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse33 (+ |c_~#queue~0.offset| (* (select .cse32 .cse9) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse31 (store .cse32 .cse33 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse30 (select .cse31 .cse9))) (or (= 400 .cse30) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse31 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse30 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse9) 401)))))) (< .cse33 0))))))) (.cse1 (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|))) (and (or .cse0 .cse1) (or .cse0 .cse2) (or .cse2 .cse3) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse14 .cse15 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| 1))))) (let ((.cse13 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (select .cse12 .cse9))) (or (= 400 .cse4) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse11 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse12 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse11 .cse9) 4)))) (or (< .cse5 0) (forall ((v_subst_3 Int)) (let ((.cse7 (store .cse11 .cse5 v_subst_3))) (let ((.cse10 (select .cse7 .cse9))) (or (forall ((v_subst_2 Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 (+ v_subst_2 1)) .cse9 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse9) 401)) (= 400 .cse10))))))))))))) (< (select .cse13 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|))))) (< .cse16 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50|))) (or .cse3 .cse1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse14 .cse15 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50| 1))))) (let ((.cse24 (select (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (store .cse24 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse23 (select .cse22 .cse9))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse22 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse17 (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)))) (or (< .cse17 0) (forall ((v_subst_4 Int)) (let ((.cse20 (store .cse21 .cse17 v_subst_4))) (let ((.cse18 (select .cse20 .cse9))) (or (= 400 .cse18) (forall ((v_subst_1 Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse8 (+ v_subst_1 1)) .cse9 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse9)) |c_~#queue~0.offset|))))))))))) (= 400 .cse23))))) (< (select .cse24 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|))))) (< .cse16 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_50|)))))))) is different from false [2023-12-02 20:46:04,041 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse38 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse39 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse40 (select .cse38 .cse39))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse29 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse38 .cse39 (+ .cse40 1)))) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (and (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store .cse29 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 401)) (forall ((v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse29 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) (.cse12 (= 400 .cse40)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse38 .cse39 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse13 (and (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse32 (select (store .cse29 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse33 (+ |c_~#queue~0.offset| (* (select .cse32 .cse4) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse30 (store .cse32 .cse33 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse31 (select .cse30 .cse4))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse31 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (= 400 .cse31))))) (< .cse33 0))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse36 (select (store .cse29 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse37 (+ |c_~#queue~0.offset| (* (select .cse36 .cse4) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse35 (store .cse36 .cse37 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse34 (select .cse35 .cse4))) (or (= 400 .cse34) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse29 |c_~#queue~0.base| (store (store .cse35 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse34 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 401)))))) (< .cse37 0))))))) (.cse11 (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse9 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse8 (select .cse7 .cse4))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse5 (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse7 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse6 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_subst_3 Int)) (let ((.cse2 (store .cse5 .cse6 v_subst_3))) (let ((.cse0 (select .cse2 .cse4))) (or (= .cse0 400) (forall ((v_subst_2 Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 (+ v_subst_2 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 401)))))) (< .cse6 0))))) (= 400 .cse8))))) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|)))) (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 401)) (or .cse10 .cse11) (or .cse10 .cse12) (or .cse12 .cse13) (forall ((v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse17 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse14 (+ (* (select .cse17 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse14 0) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse15 (store .cse17 .cse14 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse16 (select .cse15 .cse4))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse15 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 401)) (= 400 .cse16))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse24 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (store .cse24 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse23 (select .cse22 .cse4))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse21 (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse22 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse18 (+ (* (select .cse21 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse18 0) (forall ((v_subst_4 Int)) (let ((.cse20 (store .cse21 .cse18 v_subst_4))) (let ((.cse19 (select .cse20 .cse4))) (or (= 400 .cse19) (forall ((v_subst_1 Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse20 .cse3 (+ v_subst_1 1)) .cse4 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))))) (= 400 .cse23))))) (< (select .cse24 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|)))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse28 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse25 (+ (* (select .cse28 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse25 0) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse27 (store .cse28 .cse25 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse26 (select .cse27 .cse4))) (or (= 400 .cse26) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse27 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))))))))))) (or .cse13 .cse11)))))) is different from false [2023-12-02 20:46:04,431 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_488 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (< (select .cse1 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse8 (select .cse7 .cse0))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse0 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse0) 4)))) (or (forall ((v_subst_4 Int)) (let ((.cse3 (store .cse5 .cse6 v_subst_4))) (let ((.cse2 (select .cse3 .cse0))) (or (= 400 .cse2) (forall ((v_subst_1 Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse0 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))))) (< .cse6 0))))) (= 400 .cse8)))))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse0) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (store .cse11 .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse10 (select .cse9 .cse0))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse0 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 401)) (= 400 .cse10))))) (< .cse12 0))))) (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse16 (+ |c_~#queue~0.offset| (* (select .cse15 .cse0) 4)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (store .cse15 .cse16 |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse14 (select .cse13 .cse0))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_488 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse0 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (= 400 .cse14))))) (< .cse16 0))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (or (< (select .cse17 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse23 (select .cse22 .cse0))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse0 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_484) |c_~#queue~0.base|))) (let ((.cse21 (+ |c_~#queue~0.offset| (* (select .cse20 .cse0) 4)))) (or (forall ((v_subst_3 Int)) (let ((.cse18 (store .cse20 .cse21 v_subst_3))) (let ((.cse19 (select .cse18 .cse0))) (or (forall ((v_subst_2 Int) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse18 .cse4 (+ v_subst_2 1)) .cse0 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 401)) (= 400 .cse19))))) (< .cse21 0))))) (= 400 .cse23)))))))) (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|) .cse0) 401)))) is different from false [2023-12-02 20:46:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:46:09,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:46:09,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:09,951 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:46:09,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 498584845, now seen corresponding path program 1 times [2023-12-02 20:46:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667071004] [2023-12-02 20:46:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 164 proven. 53 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-02 20:46:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667071004] [2023-12-02 20:46:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667071004] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384401694] [2023-12-02 20:46:12,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:12,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:12,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:12,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:12,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:46:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:12,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 20:46:12,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:13,213 INFO L378 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 [2023-12-02 20:46:13,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:13,263 INFO L378 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 13 [2023-12-02 20:46:13,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:13,390 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-12-02 20:46:13,390 INFO L378 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 42 treesize of output 16 [2023-12-02 20:46:13,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:13,424 INFO L378 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 29 treesize of output 13 [2023-12-02 20:46:13,529 INFO L378 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 23 treesize of output 13 [2023-12-02 20:46:13,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:13,581 INFO L378 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 13 [2023-12-02 20:46:13,653 INFO L378 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 9 treesize of output 3 [2023-12-02 20:46:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 140 proven. 29 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-12-02 20:46:13,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:13,783 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_962 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_962 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-02 20:46:13,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_962 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_962 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-02 20:46:13,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse4)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse4)))))))) is different from false [2023-12-02 20:46:13,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-02 20:46:17,572 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2023-12-02 20:46:17,595 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_958 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_958) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)))) (forall ((v_ArrVal_958 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_958) |c_~#queue~0.base|))) (or (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2023-12-02 20:46:17,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:17,626 INFO L378 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 114 treesize of output 84 [2023-12-02 20:46:17,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:17,635 INFO L378 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 107 treesize of output 109 [2023-12-02 20:46:17,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:46:17,644 INFO L378 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 13 treesize of output 9 [2023-12-02 20:46:17,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:46:17,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:17,672 INFO L378 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 55 treesize of output 51 [2023-12-02 20:46:17,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:17,701 INFO L378 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 117 treesize of output 87 [2023-12-02 20:46:17,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:17,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:17,710 INFO L378 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 3 case distinctions, treesize of input 78 treesize of output 73 [2023-12-02 20:46:17,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:17,718 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:46:17,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:17,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 75 treesize of output 65 [2023-12-02 20:46:17,736 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:17,736 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:17,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:17,739 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 20:46:17,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:17,747 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:46:18,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:18,280 INFO L378 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 25 treesize of output 29 [2023-12-02 20:46:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 238 trivial. 71 not checked. [2023-12-02 20:46:18,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384401694] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:18,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 38 [2023-12-02 20:46:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881265481] [2023-12-02 20:46:18,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:18,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 20:46:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 20:46:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=953, Unknown=20, NotChecked=414, Total=1560 [2023-12-02 20:46:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:18,353 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:18,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.0) internal successors, (156), 39 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:46:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:46:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-12-02 20:46:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:46:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:46:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:46:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 20:46:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:46:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:46:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:46:20,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:46:20,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 20:46:20,972 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:46:20,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash -52391603, now seen corresponding path program 2 times [2023-12-02 20:46:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584700233] [2023-12-02 20:46:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 308 proven. 120 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-02 20:46:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:25,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584700233] [2023-12-02 20:46:25,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584700233] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:25,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423444860] [2023-12-02 20:46:25,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:46:25,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:25,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:25,501 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:25,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 20:46:25,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:46:25,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:46:25,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 188 conjunts are in the unsatisfiable core [2023-12-02 20:46:25,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:25,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:25,809 INFO L378 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 [2023-12-02 20:46:25,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:46:25,903 INFO L378 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 11 [2023-12-02 20:46:25,971 INFO L378 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 11 [2023-12-02 20:46:26,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:26,137 INFO L378 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 27 treesize of output 11 [2023-12-02 20:46:26,170 INFO L378 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 11 [2023-12-02 20:46:26,271 INFO L378 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 23 treesize of output 3 [2023-12-02 20:46:26,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:26,337 INFO L378 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 11 [2023-12-02 20:46:26,470 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:46:26,470 INFO L378 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 34 treesize of output 14 [2023-12-02 20:46:26,503 INFO L378 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 11 [2023-12-02 20:46:26,656 INFO L378 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 36 treesize of output 13 [2023-12-02 20:46:26,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:26,704 INFO L378 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 11 [2023-12-02 20:46:26,822 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:46:26,822 INFO L378 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 34 treesize of output 14 [2023-12-02 20:46:26,860 INFO L378 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 11 [2023-12-02 20:46:27,007 INFO L378 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 36 treesize of output 13 [2023-12-02 20:46:27,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:27,049 INFO L378 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 11 [2023-12-02 20:46:27,153 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:46:27,154 INFO L378 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 34 treesize of output 14 [2023-12-02 20:46:27,180 INFO L378 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 11 [2023-12-02 20:46:27,297 INFO L378 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 36 treesize of output 13 [2023-12-02 20:46:27,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:27,341 INFO L378 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 11 [2023-12-02 20:46:27,462 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:46:27,462 INFO L378 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 34 treesize of output 14 [2023-12-02 20:46:27,496 INFO L378 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 11 [2023-12-02 20:46:27,626 INFO L378 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 36 treesize of output 13 [2023-12-02 20:46:27,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:27,673 INFO L378 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 11 [2023-12-02 20:46:27,790 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:46:27,790 INFO L378 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 34 treesize of output 14 [2023-12-02 20:46:27,819 INFO L378 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 11 [2023-12-02 20:46:27,940 INFO L378 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 36 treesize of output 13 [2023-12-02 20:46:27,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:27,990 INFO L378 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 11 [2023-12-02 20:46:28,127 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:46:28,127 INFO L378 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 34 treesize of output 14 [2023-12-02 20:46:28,169 INFO L378 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 11 [2023-12-02 20:46:28,261 INFO L378 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 36 treesize of output 13 [2023-12-02 20:46:28,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:28,310 INFO L378 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 11 [2023-12-02 20:46:28,440 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:46:28,440 INFO L378 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 34 treesize of output 14 [2023-12-02 20:46:28,451 INFO L378 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 11 [2023-12-02 20:46:28,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 20:46:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 290 proven. 280 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-02 20:46:28,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:56,129 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (v_ArrVal_1198 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse6 .cse3)) (.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400) (= .cse0 400) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|))))))) is different from false [2023-12-02 20:46:56,526 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))))) (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse5 (select .cse9 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (= 400 .cse5) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|))))))))) is different from false [2023-12-02 20:46:56,585 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))))) (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse5 (select .cse9 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (= 400 .cse5) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|)))))))))) is different from false [2023-12-02 20:47:01,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (select .cse9 .cse10))) (or (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))))) (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse8 .cse2)) (.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (or (= .cse0 400) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse2) 400) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|)))))))) (= 400 .cse7)))) is different from false [2023-12-02 20:47:01,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse10))) (or (= 400 .cse0) (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))))) (let ((.cse2 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse8 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse1 (select .cse8 .cse3))) (or (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (= 400 .cse1)))))))))))) is different from false [2023-12-02 20:47:27,299 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse12 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse11 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse9 (select .cse12 .cse1)) (.cse8 (select .cse11 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (= 400 .cse8) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse9 400) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|))))))))))) is different from false [2023-12-02 20:47:35,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse12 .cse13))) (or (= 400 .cse0) (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))))) (let ((.cse7 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse10 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse10 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse1 (select .cse11 .cse3)) (.cse5 (select .cse10 .cse3)) (.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (or (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (= .cse5 400) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400))))))))))))) is different from false [2023-12-02 20:47:35,764 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse12 .cse13))) (or (= 400 .cse0) (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))))) (let ((.cse2 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse11 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse10 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse1 (select .cse11 .cse3)) (.cse6 (select .cse10 .cse3)) (.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (or (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (= 400 .cse1) (= 400 .cse6) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|)))))))))))))) is different from false [2023-12-02 20:48:18,253 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse11 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse4 (select .cse12 .cse1)) (.cse2 (select .cse11 .cse1)) (.cse6 (select .cse10 .cse1)) (.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (= 400 .cse2) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (= 400 .cse4) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (= 400 .cse6) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|))))))))))) is different from false [2023-12-02 20:48:18,515 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse2 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse11 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse13 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse13 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse12 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse12 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse13 .cse3)) (.cse1 (select .cse12 .cse3)) (.cse8 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse10 (select .cse11 .cse3))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= 400 .cse0) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= 400 .cse10)))))))))))) is different from false [2023-12-02 20:48:18,684 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))))) (let ((.cse8 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse15 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse15 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse14 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse0 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse14 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse9 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse13 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse5 (select .cse15 .cse1)) (.cse10 (select .cse14 .cse1)) (.cse3 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse4 (select .cse13 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (= 400 .cse5) (= .cse10 400) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse3 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (= 400 .cse4))))))))))))) is different from false [2023-12-02 20:48:18,843 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))))) (let ((.cse8 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse15 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse15 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse14 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse0 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse14 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse9 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse13 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse5 (select .cse15 .cse1)) (.cse10 (select .cse14 .cse1)) (.cse3 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse4 (select .cse13 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (= 400 .cse5) (= .cse10 400) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse3 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (= 400 .cse4))))))))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2023-12-02 20:48:19,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse15 .cse16))) (or (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse15 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))))) (let ((.cse7 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse14 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse14 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse13 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse13 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse12 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse5 (select .cse14 .cse1)) (.cse9 (select .cse13 .cse1)) (.cse3 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse4 (select .cse12 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (= 400 .cse5) (= .cse9 400) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (= 400 .cse4)))))))))))) (= 400 .cse6)))) is different from false [2023-12-02 20:49:16,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse12 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse15 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse14 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse15 .cse2)) (.cse6 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse7 (select .cse14 .cse2)) (.cse4 (select .cse13 .cse2)) (.cse9 (select .cse12 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (= 400 .cse4) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (= 400 .cse0) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse2) 400) (= 400 .cse7) (= 400 .cse9) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|))))))))))))) is different from false [2023-12-02 20:49:18,617 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))))) (let ((.cse5 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse17 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse14 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse17 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse16 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse8 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse16 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse15 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse11 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse15 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse18 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse10 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse18 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse18 .cse2)) (.cse1 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse12 (select .cse17 .cse2)) (.cse9 (select .cse16 .cse2)) (.cse3 (select .cse15 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= 400 .cse9) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (= 400 .cse0) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse1 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse2) 400) (= 400 .cse12) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (= 400 .cse3))))))))))))))) is different from false [2023-12-02 20:49:18,857 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))))) (let ((.cse5 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse17 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse14 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse17 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse16 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse8 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse16 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse15 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse11 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse15 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse18 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse10 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse18 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse18 .cse2)) (.cse1 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse12 (select .cse17 .cse2)) (.cse9 (select .cse16 .cse2)) (.cse3 (select .cse15 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= 400 .cse9) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (= 400 .cse0) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse1 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse2) 400) (= 400 .cse12) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (= 400 .cse3)))))))))))))))) is different from false [2023-12-02 20:49:19,114 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse18 .cse19))) (or (= 400 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse18 .cse19 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))))) (let ((.cse6 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse16 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse13 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse16 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse15 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse7 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse15 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse14 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse10 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse14 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse17 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse9 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse17 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse1 (select .cse17 .cse3)) (.cse2 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse11 (select .cse16 .cse3)) (.cse8 (select .cse15 .cse3)) (.cse4 (select .cse14 .cse3))) (or (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= 400 .cse8) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (= 400 .cse1) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400) (= 400 .cse11) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (= 400 .cse4))))))))))))))))) is different from false [2023-12-02 20:49:19,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse18 .cse19))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse19 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))))) (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse17 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse12 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse17 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse14 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse14 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse15 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse15 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse16 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse13 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse16 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse17 .cse2)) (.cse1 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse11 (select .cse16 .cse2)) (.cse7 (select .cse15 .cse2)) (.cse10 (select .cse14 .cse2))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse2) 400) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (= 400 .cse11) (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (= 400 .cse7) (= 400 .cse10)))))))))))))) (= 400 .cse5)))) is different from false [2023-12-02 20:49:19,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse18 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse19 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse18 .cse19))) (or (= 400 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse19 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))))) (let ((.cse2 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse15 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse15 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse16 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse16 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse14 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse13 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse14 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse17 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse12 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse17 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse4 (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse8 (select .cse17 .cse3)) (.cse1 (select .cse16 .cse3)) (.cse9 (select .cse15 .cse3)) (.cse11 (select .cse14 .cse3))) (or (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (= 400 .cse8) (= 400 .cse1) (= 400 .cse9) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= 400 .cse11) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|)))))))))))))))))) is different from false [2023-12-02 20:50:45,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1182 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse6 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|))) (let ((.cse18 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse14 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse18 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse19 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|))) (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse19 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse16 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse5 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse16 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse15 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse7 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse15 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse17 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse11 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse17 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse1 (select .cse19 .cse3)) (.cse0 (select .cse18 .cse3)) (.cse10 (select .cse17 .cse3)) (.cse2 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse8 (select .cse16 .cse3)) (.cse9 (select .cse15 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (= 400 .cse8) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (= 400 .cse9) (= 400 .cse10) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse3) 400) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|)))))))))))))))) is different from false [2023-12-02 20:50:45,344 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1182 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| 1))))) (let ((.cse15 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|))) (let ((.cse19 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse14 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse19 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse18 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|))) (let ((.cse6 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse18 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse17 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse17 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse20 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse13 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse20 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse21 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse16 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse21 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse0 (select .cse21 .cse7)) (.cse1 (select .cse20 .cse7)) (.cse8 (store .cse16 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse5 (select .cse19 .cse7)) (.cse9 (select .cse18 .cse7)) (.cse2 (select .cse17 .cse7))) (or (= 400 .cse0) (= .cse1 400) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144|) (= .cse5 400) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= 400 .cse9) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse10 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse7) 400) (< (select .cse13 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse14 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse15 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (= 400 .cse2) (< (select .cse16 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|))))))))))))))))) is different from false [2023-12-02 20:50:46,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| Int) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1182 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| 1))))) (let ((.cse11 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|))) (let ((.cse20 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse16 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse20 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse21 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|))) (let ((.cse1 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse21 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse17 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse12 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse17 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse18 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse10 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse18 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse19 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse9 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse19 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse3 (select .cse21 .cse2)) (.cse0 (select .cse20 .cse2)) (.cse6 (select .cse19 .cse2)) (.cse5 (select .cse18 .cse2)) (.cse13 (select .cse17 .cse2)) (.cse14 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (= 400 .cse3) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (= 400 .cse6) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144|) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= 400 .cse5) (= 400 .cse13) (< (select (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse14 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse2) 400))))))))))))))))) is different from false [2023-12-02 20:50:47,091 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| Int) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1182 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse13 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| 1))))) (let ((.cse8 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|))) (let ((.cse17 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_104|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse17 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse18 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|))) (let ((.cse15 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse18 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse20 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse12 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse20 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse21 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse16 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse21 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse19 (store .cse16 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse19 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse1 (select .cse21 .cse4)) (.cse9 (select .cse20 .cse4)) (.cse11 (select .cse19 .cse4)) (.cse2 (select .cse18 .cse4)) (.cse0 (select .cse17 .cse4)) (.cse6 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (or (= 400 .cse0) (= 400 .cse1) (= 400 .cse2) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse4) 400) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse10 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse12 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select .cse13 .cse14) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144|) (< (select .cse15 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (= 400 .cse9) (= 400 .cse11) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse16 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|))))))))))))))))) is different from false [2023-12-02 20:50:47,524 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160| Int)) (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| Int) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1182 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse14 (store .cse22 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse15 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| 1))))) (let ((.cse12 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|))) (let ((.cse20 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_104|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse20 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse19 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|))) (let ((.cse16 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse19 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse21 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse21 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse18 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse18 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse17 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse11 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse17 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse2 (select .cse21 .cse1)) (.cse7 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse9 (select .cse20 .cse1)) (.cse3 (select .cse19 .cse1)) (.cse10 (select .cse18 .cse1)) (.cse13 (select .cse17 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (= 400 .cse2) (= 400 .cse3) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse1) 400) (= 400 .cse9) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse10 400) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (= 400 .cse13) (< (select .cse14 .cse15) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144|) (< (select .cse16 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|))))))))))))))))) (< (select .cse22 .cse15) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160|)))) is different from false [2023-12-02 20:51:04,731 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| Int) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1194 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| Int) (v_ArrVal_1206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1202 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| Int) (v_ArrVal_1186 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| Int) (v_ArrVal_1182 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1177)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1178))) (let ((.cse9 (select .cse3 |c_~#queue~0.base|))) (let ((.cse16 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse14 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse16 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144| 1))) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|))) (let ((.cse19 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_104|))) (let ((.cse11 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse19 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_159| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141| 1))) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|))) (let ((.cse17 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|))) (let ((.cse10 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse17 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_155| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138| 1))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (let ((.cse18 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_98|))) (let ((.cse6 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse18 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_151| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135| 1))) |c_~#stored_elements~0.base| v_ArrVal_1194) |c_~#queue~0.base|))) (let ((.cse21 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|))) (let ((.cse13 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse21 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_147| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132| 1))) |c_~#stored_elements~0.base| v_ArrVal_1198) |c_~#queue~0.base|))) (let ((.cse20 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_92|))) (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse20 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)) (.cse7 (select .cse21 .cse2)) (.cse0 (select .cse20 .cse2)) (.cse8 (select .cse19 .cse2)) (.cse12 (select .cse18 .cse2)) (.cse15 (select .cse17 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_129|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_139| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))) |c_~#stored_elements~0.base| v_ArrVal_1206) |c_~#queue~0.base|) .cse2) 400) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_132|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= 400 .cse8) (= 400 .cse7) (= 400 .cse0) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_141|) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160|) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_151|) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_154|) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_135|) (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_145|) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (= .cse12 400) (= 400 .cse15) (< (select .cse16 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_144|) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_138|)))))))))))))))))) is different from false [2023-12-02 20:51:04,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:51:04,835 INFO L378 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 3633 treesize of output 2393 [2023-12-02 20:51:05,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:51:05,025 INFO L378 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 7126 treesize of output 7106 [2023-12-02 20:51:05,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:51:05,289 INFO L378 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 935 treesize of output 927 [2023-12-02 20:51:05,389 INFO L378 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 312 treesize of output 288 [2023-12-02 20:51:05,495 INFO L378 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 66 treesize of output 54 [2023-12-02 20:51:05,604 INFO L378 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 66 treesize of output 54 [2023-12-02 20:51:05,720 INFO L378 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 42 treesize of output 34 [2023-12-02 20:51:05,857 INFO L378 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 66 treesize of output 54 [2023-12-02 20:51:05,977 INFO L378 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 66 treesize of output 54 [2023-12-02 20:51:06,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:51:08,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:51:08,543 INFO L378 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 677 treesize of output 673 [2023-12-02 20:51:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 290 proven. 81 refuted. 25 times theorem prover too weak. 48 trivial. 174 not checked. [2023-12-02 20:51:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423444860] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:51:10,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:51:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 42, 67] total 130 [2023-12-02 20:51:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781933003] [2023-12-02 20:51:10,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:51:10,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2023-12-02 20:51:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:51:10,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2023-12-02 20:51:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=8809, Unknown=462, NotChecked=5800, Total=17030 [2023-12-02 20:51:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:51:10,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:51:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 2.2061068702290076) internal successors, (289), 130 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:51:10,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:27,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 20:52:27,091 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 20:52:27,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 20:52:27,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 20:52:27,292 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 53 more [2023-12-02 20:52:27,296 INFO L158 Benchmark]: Toolchain (without parser) took 626191.92ms. Allocated memory was 161.5MB in the beginning and 509.6MB in the end (delta: 348.1MB). Free memory was 123.0MB in the beginning and 429.0MB in the end (delta: -306.0MB). Peak memory consumption was 330.2MB. Max. memory is 16.1GB. [2023-12-02 20:52:27,296 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 20:52:27,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.67ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 92.3MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-12-02 20:52:27,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 161.5MB. Free memory was 92.3MB in the beginning and 89.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 20:52:27,296 INFO L158 Benchmark]: Boogie Preprocessor took 39.69ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 86.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:52:27,297 INFO L158 Benchmark]: RCFGBuilder took 793.89ms. Allocated memory is still 161.5MB. Free memory was 86.6MB in the beginning and 76.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-12-02 20:52:27,297 INFO L158 Benchmark]: TraceAbstraction took 624710.83ms. Allocated memory was 161.5MB in the beginning and 509.6MB in the end (delta: 348.1MB). Free memory was 75.2MB in the beginning and 429.0MB in the end (delta: -353.8MB). Peak memory consumption was 284.7MB. Max. memory is 16.1GB. [2023-12-02 20:52:27,298 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.67ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 92.3MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 161.5MB. Free memory was 92.3MB in the beginning and 89.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.69ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 86.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 793.89ms. Allocated memory is still 161.5MB. Free memory was 86.6MB in the beginning and 76.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 624710.83ms. Allocated memory was 161.5MB in the beginning and 509.6MB in the end (delta: 348.1MB). Free memory was 75.2MB in the beginning and 429.0MB in the end (delta: -353.8MB). Peak memory consumption was 284.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-02 20:52:27,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:52:29,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:52:29,382 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Bitvector.epf [2023-12-02 20:52:29,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:52:29,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:52:29,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:52:29,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:52:29,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:52:29,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:52:29,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:52:29,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:52:29,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:52:29,418 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:52:29,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:52:29,419 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:52:29,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:52:29,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:52:29,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:52:29,421 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 20:52:29,422 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 20:52:29,422 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 20:52:29,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:52:29,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 20:52:29,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 20:52:29,425 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 20:52:29,425 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:52:29,426 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:52:29,426 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:52:29,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:52:29,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:52:29,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:52:29,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:52:29,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:52:29,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:52:29,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:52:29,429 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-02 20:52:29,429 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 20:52:29,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:52:29,430 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:52:29,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:52:29,430 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:52:29,431 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:52:29,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 20:52:29,431 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/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_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-12-02 20:52:29,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:52:29,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:52:29,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:52:29,752 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:52:29,752 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:52:29,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:52:32,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:52:32,803 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:52:32,803 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:52:32,822 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data/786b10436/35ce89d6cef041dd9645ef47531eff71/FLAGfea3467a0 [2023-12-02 20:52:32,837 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/data/786b10436/35ce89d6cef041dd9645ef47531eff71 [2023-12-02 20:52:32,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:52:32,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:52:32,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:52:32,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:52:32,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:52:32,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:52:32" (1/1) ... [2023-12-02 20:52:32,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391eb99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:32, skipping insertion in model container [2023-12-02 20:52:32,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:52:32" (1/1) ... [2023-12-02 20:52:32,919 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:52:33,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:52:33,427 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:52:33,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:52:33,561 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:52:33,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33 WrapperNode [2023-12-02 20:52:33,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:52:33,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:52:33,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:52:33,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:52:33,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,623 INFO L138 Inliner]: procedures = 279, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 210 [2023-12-02 20:52:33,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:52:33,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:52:33,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:52:33,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:52:33,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:52:33,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:52:33,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:52:33,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:52:33,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (1/1) ... [2023-12-02 20:52:33,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:52:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:52:33,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:52:33,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:52:33,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 20:52:33,782 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 20:52:33,783 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 20:52:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 20:52:33,783 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 20:52:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:52:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:52:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 20:52:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 20:52:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-12-02 20:52:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:52:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:52:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:52:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:52:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:52:33,787 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:52:33,942 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:52:33,944 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:52:34,545 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:52:34,740 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:52:34,741 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:52:34,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:52:34 BoogieIcfgContainer [2023-12-02 20:52:34,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:52:34,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:52:34,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:52:34,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:52:34,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:52:32" (1/3) ... [2023-12-02 20:52:34,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c1485c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:52:34, skipping insertion in model container [2023-12-02 20:52:34,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:52:33" (2/3) ... [2023-12-02 20:52:34,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c1485c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:52:34, skipping insertion in model container [2023-12-02 20:52:34,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:52:34" (3/3) ... [2023-12-02 20:52:34,749 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-12-02 20:52:34,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:52:34,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-12-02 20:52:34,763 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:52:34,879 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 20:52:34,925 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:52:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:52:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:52:34,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:52:34,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:52:34,973 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:52:34,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-12-02 20:52:34,991 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4ff303e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:52:34,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-12-02 20:52:36,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:52:36,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 353109407, now seen corresponding path program 1 times [2023-12-02 20:52:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:52:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138155764] [2023-12-02 20:52:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:36,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:52:36,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:52:36,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 20:52:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:36,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:52:36,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:52:36,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:52:36,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:52:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138155764] [2023-12-02 20:52:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138155764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:52:36,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:52:36,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:52:36,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574848014] [2023-12-02 20:52:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:52:36,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:52:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:52:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:52:36,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:52:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:36,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:52:36,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:52:36,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:37,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:52:38,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:38,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:52:38,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 353109408, now seen corresponding path program 1 times [2023-12-02 20:52:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:52:38,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020406970] [2023-12-02 20:52:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:38,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:38,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:52:38,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:52:38,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 20:52:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:38,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 20:52:38,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:38,333 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:52:38,334 INFO L378 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 13 treesize of output 13 [2023-12-02 20:52:38,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:52:38,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:52:38,616 INFO L378 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 16 [2023-12-02 20:52:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:52:38,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:52:38,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:52:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020406970] [2023-12-02 20:52:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020406970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:52:38,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:52:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 20:52:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329257310] [2023-12-02 20:52:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:52:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 20:52:38,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:52:38,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 20:52:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:52:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:38,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:52:38,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:52:38,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:38,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:40,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 20:52:40,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:40,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:52:40,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1938509521, now seen corresponding path program 1 times [2023-12-02 20:52:40,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:52:40,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192911310] [2023-12-02 20:52:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:40,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:52:40,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:52:40,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 20:52:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:40,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 20:52:40,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:52:40,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:52:40,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:52:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192911310] [2023-12-02 20:52:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192911310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:52:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:52:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:52:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823444652] [2023-12-02 20:52:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:52:40,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:52:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:52:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:52:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:52:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:40,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:52:40,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:52:40,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:40,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:40,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:44,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 20:52:44,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:44,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:52:44,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:44,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1138569655, now seen corresponding path program 1 times [2023-12-02 20:52:44,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:52:44,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665655008] [2023-12-02 20:52:44,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:52:44,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:52:44,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 20:52:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:44,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 20:52:44,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:44,566 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:52:44,567 INFO L378 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 13 treesize of output 13 [2023-12-02 20:52:44,611 INFO L378 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 [2023-12-02 20:52:44,654 INFO L378 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 23 treesize of output 22 [2023-12-02 20:52:44,778 INFO L378 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 27 treesize of output 20 [2023-12-02 20:52:44,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:52:44,955 INFO L378 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 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-02 20:52:44,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:52:44,987 INFO L378 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 1 case distinctions, treesize of input 38 treesize of output 16 [2023-12-02 20:52:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:52:45,033 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:52:45,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:52:45,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665655008] [2023-12-02 20:52:45,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665655008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:52:45,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:52:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 20:52:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050804500] [2023-12-02 20:52:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:52:45,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 20:52:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:52:45,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 20:52:45,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-02 20:52:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:45,037 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:52:45,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:52:45,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:45,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:45,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:45,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:52:46,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 20:52:47,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:47,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:52:47,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash 936996880, now seen corresponding path program 1 times [2023-12-02 20:52:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:52:47,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654064790] [2023-12-02 20:52:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:47,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:47,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:52:47,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:52:47,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 20:52:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:47,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:52:47,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:47,350 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 20:52:47,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2023-12-02 20:52:47,387 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-02 20:52:47,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 24 [2023-12-02 20:52:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:52:47,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:52:47,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:52:47,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654064790] [2023-12-02 20:52:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654064790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:52:47,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:52:47,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:52:47,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543206506] [2023-12-02 20:52:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:52:47,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:52:47,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:52:47,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:52:47,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:52:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:47,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:52:47,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:52:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:52:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:52:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:49,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 20:52:49,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:49,345 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:52:49,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 936996881, now seen corresponding path program 1 times [2023-12-02 20:52:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:52:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152889884] [2023-12-02 20:52:49,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:49,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:49,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:52:49,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:52:49,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 20:52:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:49,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 20:52:49,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:49,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:52:49,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-12-02 20:52:49,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:52:49,519 INFO L378 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 13 treesize of output 9 [2023-12-02 20:52:49,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:52:49,543 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 20:52:49,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 18 [2023-12-02 20:52:49,557 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:52:49,557 INFO L378 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:52:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:52:50,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:52:50,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:52:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152889884] [2023-12-02 20:52:50,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152889884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:52:50,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:52:50,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:52:50,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609869844] [2023-12-02 20:52:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:52:50,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:52:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:52:50,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:52:50,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:52:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:50,276 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:52:50,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:52:50,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:50,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:50,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:50,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:52:50,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:50,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:52:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:52:51,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 20:52:51,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:51,693 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:52:51,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1082328312, now seen corresponding path program 1 times [2023-12-02 20:52:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:52:51,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314879219] [2023-12-02 20:52:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:52:51,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:52:51,695 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:52:51,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 20:52:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:51,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 20:52:51,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:51,879 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:52:51,880 INFO L378 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 13 treesize of output 13 [2023-12-02 20:52:51,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:52:51,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:52:52,093 INFO L378 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 16 [2023-12-02 20:52:52,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:52:52,341 INFO L378 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 30 treesize of output 14 [2023-12-02 20:52:52,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:52:52,485 INFO L378 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 11 [2023-12-02 20:52:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:52:52,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:52:52,661 INFO L378 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 50 treesize of output 46 [2023-12-02 20:52:52,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((v_ArrVal_175 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_175) |c_~#queue~0.base|) .cse0))) (bvadd (_ bv1608 32) |c_~#queue~0.offset|))) (forall ((v_ArrVal_175 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_175) |c_~#queue~0.base|) .cse0)))) (bvule (bvadd |c_~#queue~0.offset| .cse1) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse1)))))) is different from false [2023-12-02 20:52:52,932 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (bvadd (_ bv1 32) |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse2 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((v_ArrVal_175 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_175) |c_~#queue~0.base|) .cse2) (_ bv4 32)))) (bvule (bvadd .cse0 |c_~#queue~0.offset|) (bvadd (_ bv4 32) .cse0 |c_~#queue~0.offset|)))) (forall ((v_ArrVal_175 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvmul (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_175) |c_~#queue~0.base|) .cse2) (_ bv4 32)) |c_~#queue~0.offset|) (bvadd (_ bv1608 32) |c_~#queue~0.offset|))))) is different from false [2023-12-02 20:53:16,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1608 32) |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (bvadd (_ bv1608 32) |c_ULTIMATE.start_init_~q#1.offset|) (_ bv0 32)))) (.cse3 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((v_ArrVal_172 (_ BitVec 32)) (v_ArrVal_175 (Array (_ BitVec 32) (_ BitVec 32))) (|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_170 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (_ bv4 32) (select (select (store (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_170))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse4 .cse3))) |t1Thread1of1ForFork0_enqueue_~x#1|)))) (store (store .cse1 .cse2 v_ArrVal_172) .cse3 (bvadd (_ bv1 32) (select .cse1 .cse3)))))) |c_~#stored_elements~0.base| v_ArrVal_175) |c_~#queue~0.base|) .cse3))) .cse2)) (forall ((v_ArrVal_172 (_ BitVec 32)) (v_ArrVal_175 (Array (_ BitVec 32) (_ BitVec 32))) (|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_170 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul (_ bv4 32) (select (select (store (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_170))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse9 .cse3))) |t1Thread1of1ForFork0_enqueue_~x#1|)))) (store (store .cse8 .cse2 v_ArrVal_172) .cse3 (bvadd (_ bv1 32) (select .cse8 .cse3)))))) |c_~#stored_elements~0.base| v_ArrVal_175) |c_~#queue~0.base|) .cse3)))) (bvule (bvadd |c_~#queue~0.offset| .cse6) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse6)))))) is different from false [2023-12-02 20:53:16,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:16,242 INFO L378 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 308 treesize of output 179 [2023-12-02 20:53:16,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:16,315 INFO L378 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 184 treesize of output 180 [2023-12-02 20:53:16,330 INFO L378 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 156 treesize of output 140 [2023-12-02 20:53:16,362 INFO L378 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 82 treesize of output 66 [2023-12-02 20:53:16,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:16,497 INFO L378 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 [2023-12-02 20:53:16,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:16,877 INFO L378 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 105 treesize of output 99 [2023-12-02 20:53:19,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:19,149 INFO L378 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 158 treesize of output 104 [2023-12-02 20:53:19,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:19,228 INFO L378 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 132 treesize of output 132 [2023-12-02 20:53:19,247 INFO L378 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 108 treesize of output 100 [2023-12-02 20:53:19,277 INFO L378 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 70 treesize of output 58 [2023-12-02 20:53:19,380 INFO L378 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 [2023-12-02 20:53:19,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:19,503 INFO L378 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 93 treesize of output 91 [2023-12-02 20:53:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:53:25,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:53:25,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314879219] [2023-12-02 20:53:25,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314879219] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:53:25,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:53:25,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2023-12-02 20:53:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621790853] [2023-12-02 20:53:25,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:53:25,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 20:53:25,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:53:25,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 20:53:25,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=401, Unknown=59, NotChecked=138, Total=702 [2023-12-02 20:53:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:53:25,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:53:25,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:53:25,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:53:25,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:53:25,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:53:25,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:53:25,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:53:25,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:53:25,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:53:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:53:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:53:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:53:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:53:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:53:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:53:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:53:36,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 20:53:36,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:53:36,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:53:36,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:53:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1757462368, now seen corresponding path program 1 times [2023-12-02 20:53:36,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:53:36,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681554231] [2023-12-02 20:53:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:53:36,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:53:36,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:53:36,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:53:36,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 20:53:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:53:36,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 20:53:36,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:53:36,619 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:53:36,620 INFO L378 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 13 treesize of output 13 [2023-12-02 20:53:36,795 INFO L378 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 [2023-12-02 20:53:36,909 INFO L378 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 23 treesize of output 22 [2023-12-02 20:53:37,258 INFO L378 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 27 treesize of output 20 [2023-12-02 20:53:38,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:38,110 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-12-02 20:53:38,111 INFO L378 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 54 treesize of output 47 [2023-12-02 20:53:38,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:38,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:38,281 INFO L378 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 38 treesize of output 31 [2023-12-02 20:53:38,743 INFO L378 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 23 treesize of output 13 [2023-12-02 20:53:38,923 INFO L378 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 13 [2023-12-02 20:53:39,332 INFO L378 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 29 treesize of output 13 [2023-12-02 20:53:39,384 INFO L378 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 29 treesize of output 13 [2023-12-02 20:53:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:53:39,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:53:40,308 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv400 32) (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse0 (bvadd |c_~#queue~0.offset| (bvmul (select .cse0 .cse1) (_ bv4 32))) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-02 20:53:40,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv400 32) (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (bvadd (_ bv1 32) |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse0 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse0 .cse1))) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-02 20:53:40,410 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse0 (bvadd (bvmul (_ bv4 32) (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1)) (_ bv400 32)))) is different from false [2023-12-02 20:53:40,508 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_213 (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (bvadd (_ bv1608 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_213) .cse3 (bvadd (select .cse2 .cse3) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse0 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse0 .cse1))) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1)) (_ bv400 32)))) is different from false [2023-12-02 20:53:40,573 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_213 (_ BitVec 32)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_16| (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv400 32) (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (bvadd |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (bvmul (_ bv4 32) |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (bvadd (_ bv1608 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_213) .cse3 (bvadd (select .cse2 .cse3) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse0 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse0 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_16|)) .cse1))))) is different from false [2023-12-02 20:53:40,624 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_213 (_ BitVec 32)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_16| (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv400 32) (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 (bvadd (bvmul (select .cse4 .cse3) (_ bv4 32)) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)))) (store (store .cse2 (bvadd (_ bv1608 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_213) .cse3 (bvadd (_ bv1 32) (select .cse2 .cse3)))))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse0 (bvadd (bvmul (_ bv4 32) (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_16|)) .cse1))))) is different from false [2023-12-02 20:53:42,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:42,075 INFO L378 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 307 treesize of output 178 [2023-12-02 20:53:42,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:42,132 INFO L378 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 239 treesize of output 231 [2023-12-02 20:53:42,149 INFO L378 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 251 treesize of output 215 [2023-12-02 20:53:42,169 INFO L378 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 226 treesize of output 202 [2023-12-02 20:53:42,231 INFO L378 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 [2023-12-02 20:53:42,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:42,416 INFO L378 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 144 treesize of output 118 [2023-12-02 20:53:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 20:53:42,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:53:42,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681554231] [2023-12-02 20:53:42,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681554231] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:53:42,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:53:42,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2023-12-02 20:53:42,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874455997] [2023-12-02 20:53:42,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:53:42,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 20:53:42,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:53:42,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 20:53:42,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=454, Unknown=14, NotChecked=294, Total=870 [2023-12-02 20:53:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:53:42,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:53:42,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:53:42,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:53:51,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:53,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:55,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:57,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:57,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (= (select (select |c_#memory_int| (_ bv5 32)) .cse0) (_ bv1 32)) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (_ bv5 32)) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_213 (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse2 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store (store .cse3 (bvadd (_ bv1608 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_213) .cse0 (bvadd (select .cse3 .cse0) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse1 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse1 .cse2))) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse2)) (_ bv400 32)))))) is different from false [2023-12-02 20:53:57,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (= (select (select |c_#memory_int| (_ bv5 32)) .cse0) (_ bv1 32)) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (_ bv5 32)) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse2 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse3 .cse0 (bvadd (select .cse3 .cse0) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse1 (bvadd (bvmul (_ bv4 32) (select .cse1 .cse2)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse2)) (_ bv400 32)))))) is different from false [2023-12-02 20:53:58,017 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| (_ bv1 32)) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_215) |c_~#queue~0.base|))) (store .cse0 (bvadd (bvmul (_ bv4 32) (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1)) (_ bv400 32))))) is different from false [2023-12-02 20:54:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:54:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:54:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:54:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:54:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:54:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:54:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:54:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 20:54:05,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-02 20:54:05,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:54:05,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:54:05,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:54:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1352165527, now seen corresponding path program 1 times [2023-12-02 20:54:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:54:05,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343634973] [2023-12-02 20:54:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:54:05,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:54:05,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:54:05,864 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:54:05,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 20:54:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:54:06,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 20:54:06,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:54:06,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:54:06,208 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-12-02 20:54:06,208 INFO L378 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 18 treesize of output 20 [2023-12-02 20:54:06,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-12-02 20:54:06,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:54:06,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:54:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:54:07,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:54:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:54:08,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:54:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343634973] [2023-12-02 20:54:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343634973] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:54:08,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:54:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-12-02 20:54:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619116522] [2023-12-02 20:54:08,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:54:08,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 20:54:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:54:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 20:54:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:54:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:54:08,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:54:08,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:54:08,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-12-02 20:54:08,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 20:54:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:54:15,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 20:54:15,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:54:15,751 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-12-02 20:54:15,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:54:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2143415288, now seen corresponding path program 2 times [2023-12-02 20:54:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:54:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85611593] [2023-12-02 20:54:15,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:54:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:54:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:54:15,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:54:15,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08acc445-0ab1-4436-baa4-d112f78ee68c/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 20:54:16,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:54:16,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:54:16,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 20:54:16,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:54:16,118 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:54:16,118 INFO L378 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 13 treesize of output 13 [2023-12-02 20:54:16,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-12-02 20:54:16,301 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 20:54:16,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 18 [2023-12-02 20:54:16,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:54:17,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:54:17,789 INFO L378 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 16 [2023-12-02 20:54:19,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:54:19,445 INFO L378 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 30 treesize of output 14 [2023-12-02 20:54:20,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:54:20,600 INFO L378 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 11 [2023-12-02 20:54:21,381 INFO L378 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 11 [2023-12-02 20:54:21,585 INFO L378 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 11 [2023-12-02 20:54:22,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:54:22,628 INFO L378 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 11 [2023-12-02 20:54:23,472 INFO L378 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 11 [2023-12-02 20:54:23,704 INFO L378 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 11 [2023-12-02 20:54:24,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:54:24,790 INFO L378 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 11 [2023-12-02 20:54:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:54:25,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:54:26,586 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse1)))) (bvule (bvadd |c_~#queue~0.offset| .cse0) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse0)))) (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-02 20:54:26,693 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (bvadd (_ bv1 32) |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse2 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse2)))) (bvule (bvadd |c_~#queue~0.offset| .cse0) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse0)))) (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (_ bv4 32) (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse2))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-02 20:54:26,777 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (bvadd (select .cse3 .cse4) (_ bv1 32)))))) (.cse2 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse2)))) (bvule (bvadd |c_~#queue~0.offset| .cse0) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse0)))) (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (_ bv4 32) (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse2))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-02 20:54:26,937 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (bvadd (_ bv1608 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (bvadd (select .cse1 .cse3) (_ bv1 32))) (.cse5 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((v_ArrVal_312 (_ BitVec 32)) (v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_312) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse5)))) (bvule (bvadd |c_~#queue~0.offset| .cse0) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse0)))) (forall ((v_ArrVal_312 (_ BitVec 32)) (v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (_ bv4 32) (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_312) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse5))) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-12-02 20:54:27,085 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv1608 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (bvadd |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (bvmul (_ bv4 32) |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1|))) (.cse5 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_312 (_ BitVec 32)) (v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_312) .cse2 (bvadd (select .cse0 .cse2) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse5) (_ bv4 32))) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_312 (_ BitVec 32)) (v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse1 v_ArrVal_312) .cse2 (bvadd (select .cse7 .cse2) (_ bv1 32))))) |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse5) (_ bv4 32)))) (bvule (bvadd |c_~#queue~0.offset| .cse6) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse6)))))) is different from false [2023-12-02 20:54:27,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (bvadd (_ bv1604 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (bvadd (_ bv1608 32) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (bvadd (bvmul (select .cse4 .cse3) (_ bv4 32)) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (bvadd |c_~#queue~0.offset| (_ bv1604 32)))) (and (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_312 (_ BitVec 32)) (v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_312) .cse3 (bvadd (_ bv1 32) (select .cse1 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse6)))) (bvule (bvadd |c_~#queue~0.offset| .cse0) (bvadd (_ bv4 32) |c_~#queue~0.offset| .cse0)))) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| (_ BitVec 32)) (v_ArrVal_312 (_ BitVec 32)) (v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) |c_~#queue~0.offset| (bvmul (_ bv4 32) (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse4 .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse2 v_ArrVal_312) .cse3 (bvadd (_ bv1 32) (select .cse7 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_315) |c_~#queue~0.base|) .cse6))) (select |c_#length| |c_~#queue~0.base|)))))) is different from false