./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e523f48 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-5e523f4 [2024-11-21 00:48:13,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 00:48:13,921 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-21 00:48:13,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 00:48:13,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 00:48:13,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 00:48:13,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 00:48:13,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 00:48:13,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 00:48:13,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 00:48:13,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 00:48:13,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 00:48:13,961 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 00:48:13,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 00:48:13,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 00:48:13,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 00:48:13,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 00:48:13,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 00:48:13,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 00:48:13,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 00:48:13,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 00:48:13,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 00:48:13,963 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-21 00:48:13,964 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-21 00:48:13,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 00:48:13,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 00:48:13,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 00:48:13,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 00:48:13,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 00:48:13,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 00:48:13,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 00:48:13,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 00:48:13,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:48:13,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 00:48:13,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 00:48:13,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 00:48:13,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 00:48:13,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 00:48:13,966 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 00:48:13,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 00:48:13,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 00:48:13,967 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-21 00:48:13,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 00:48:13,967 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 00:48:13,967 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 00:48:13,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-11-21 00:48:14,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 00:48:14,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 00:48:14,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 00:48:14,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 00:48:14,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 00:48:14,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/../../sv-benchmarks/c/pthread/queue_longer.i [2024-11-21 00:48:17,912 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/data/5e06a5a5a/2ee969be1aed4552811c698123b3fbf0/FLAG7c3c8dc1d [2024-11-21 00:48:18,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 00:48:18,252 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/sv-benchmarks/c/pthread/queue_longer.i [2024-11-21 00:48:18,269 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/data/5e06a5a5a/2ee969be1aed4552811c698123b3fbf0/FLAG7c3c8dc1d [2024-11-21 00:48:18,284 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/data/5e06a5a5a/2ee969be1aed4552811c698123b3fbf0 [2024-11-21 00:48:18,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 00:48:18,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 00:48:18,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 00:48:18,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 00:48:18,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 00:48:18,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:48:18" (1/1) ... [2024-11-21 00:48:18,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f573d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:18, skipping insertion in model container [2024-11-21 00:48:18,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:48:18" (1/1) ... [2024-11-21 00:48:18,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 00:48:19,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:48:19,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 00:48:19,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:48:19,545 INFO L204 MainTranslator]: Completed translation [2024-11-21 00:48:19,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19 WrapperNode [2024-11-21 00:48:19,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 00:48:19,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 00:48:19,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 00:48:19,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 00:48:19,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,749 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1062 [2024-11-21 00:48:19,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 00:48:19,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 00:48:19,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 00:48:19,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 00:48:19,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 00:48:19,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 00:48:19,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 00:48:19,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 00:48:19,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (1/1) ... [2024-11-21 00:48:19,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:48:19,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:48:19,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 00:48:19,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 00:48:20,008 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-21 00:48:20,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-21 00:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-21 00:48:20,009 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-21 00:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-21 00:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-21 00:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-21 00:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-21 00:48:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 00:48:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 00:48:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 00:48:20,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 00:48:20,012 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 00:48:20,227 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 00:48:20,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 00:48:22,338 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 00:48:22,338 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 00:48:31,850 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 00:48:31,852 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 00:48:31,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:48:31 BoogieIcfgContainer [2024-11-21 00:48:31,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 00:48:31,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 00:48:31,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 00:48:31,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 00:48:31,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:48:18" (1/3) ... [2024-11-21 00:48:31,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f22dfc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:48:31, skipping insertion in model container [2024-11-21 00:48:31,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:19" (2/3) ... [2024-11-21 00:48:31,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f22dfc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:48:31, skipping insertion in model container [2024-11-21 00:48:31,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:48:31" (3/3) ... [2024-11-21 00:48:31,869 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-21 00:48:31,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 00:48:31,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2024-11-21 00:48:31,894 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 00:48:32,067 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-21 00:48:32,150 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:48:32,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 00:48:32,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:48:32,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 00:48:32,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 00:48:32,323 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:48:32,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-21 00:48:32,347 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4b5f67bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:48:32,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-21 00:48:32,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:32,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash -645449948, now seen corresponding path program 1 times [2024-11-21 00:48:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:32,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397750916] [2024-11-21 00:48:32,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:32,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:35,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:35,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397750916] [2024-11-21 00:48:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397750916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:48:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210425858] [2024-11-21 00:48:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:35,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:48:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:35,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:48:35,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:48:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:35,895 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:35,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-21 00:48:35,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:36,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 00:48:36,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:36,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1465890450, now seen corresponding path program 1 times [2024-11-21 00:48:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:36,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525919336] [2024-11-21 00:48:36,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:38,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525919336] [2024-11-21 00:48:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525919336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:38,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:38,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:48:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636713813] [2024-11-21 00:48:38,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:48:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:38,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:48:38,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:48:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:38,269 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:38,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-21 00:48:38,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:38,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:38,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 00:48:38,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:38,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash -28475147, now seen corresponding path program 1 times [2024-11-21 00:48:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502637959] [2024-11-21 00:48:38,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502637959] [2024-11-21 00:48:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502637959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:48:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170957772] [2024-11-21 00:48:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 00:48:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:40,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 00:48:40,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 00:48:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:40,281 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:40,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-21 00:48:40,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:40,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:40,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:41,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:41,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 00:48:41,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:41,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash 816263187, now seen corresponding path program 1 times [2024-11-21 00:48:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:41,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115693546] [2024-11-21 00:48:41,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:41,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115693546] [2024-11-21 00:48:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115693546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:41,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:41,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:48:41,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948198785] [2024-11-21 00:48:41,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:41,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:48:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:41,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:48:41,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:48:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:41,755 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-21 00:48:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 00:48:42,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:42,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1078525449, now seen corresponding path program 1 times [2024-11-21 00:48:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825431902] [2024-11-21 00:48:42,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825431902] [2024-11-21 00:48:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825431902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:42,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:42,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 00:48:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711194299] [2024-11-21 00:48:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:48:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:42,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:48:42,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:48:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:42,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2024-11-21 00:48:42,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:42,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 00:48:42,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:42,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:42,959 INFO L85 PathProgramCache]: Analyzing trace with hash 874496895, now seen corresponding path program 1 times [2024-11-21 00:48:42,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:42,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671149666] [2024-11-21 00:48:42,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:43,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:43,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671149666] [2024-11-21 00:48:43,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671149666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:48:43,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372569430] [2024-11-21 00:48:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:43,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:48:43,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:48:43,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:48:43,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 00:48:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:43,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1867 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 00:48:43,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:48:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:44,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 00:48:44,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372569430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:44,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 00:48:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-21 00:48:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735341512] [2024-11-21 00:48:44,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:44,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 00:48:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:44,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 00:48:44,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:48:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:44,030 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:44,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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) [2024-11-21 00:48:44,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:44,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 00:48:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:48:44,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:44,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1339602360, now seen corresponding path program 1 times [2024-11-21 00:48:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690178433] [2024-11-21 00:48:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 00:48:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690178433] [2024-11-21 00:48:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690178433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:44,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:44,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:48:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112163132] [2024-11-21 00:48:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:44,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:48:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:44,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:48:44,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:48:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:44,811 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:44,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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) [2024-11-21 00:48:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 00:48:45,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 602404250, now seen corresponding path program 1 times [2024-11-21 00:48:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977239686] [2024-11-21 00:48:45,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-21 00:48:45,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:45,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977239686] [2024-11-21 00:48:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977239686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:45,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:45,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:48:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919603982] [2024-11-21 00:48:45,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:45,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:48:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:45,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:48:45,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:48:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:45,372 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:45,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:45,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:46,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 00:48:46,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:46,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:46,205 INFO L85 PathProgramCache]: Analyzing trace with hash 580468001, now seen corresponding path program 1 times [2024-11-21 00:48:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716515782] [2024-11-21 00:48:46,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:46,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716515782] [2024-11-21 00:48:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716515782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:46,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:48:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213529579] [2024-11-21 00:48:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:46,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:48:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:46,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:48:46,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:48:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:46,436 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:46,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-11-21 00:48:46,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:46,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:46,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 00:48:46,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1853897200, now seen corresponding path program 1 times [2024-11-21 00:48:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180422450] [2024-11-21 00:48:46,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180422450] [2024-11-21 00:48:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180422450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 00:48:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114043366] [2024-11-21 00:48:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:50,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:48:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:50,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:48:50,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:48:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:50,096 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:50,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 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) [2024-11-21 00:48:50,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:50,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:50,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:50,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:50,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 00:48:50,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:50,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1636235967, now seen corresponding path program 1 times [2024-11-21 00:48:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53253263] [2024-11-21 00:48:50,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53253263] [2024-11-21 00:48:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53253263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:53,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:53,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 00:48:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323153461] [2024-11-21 00:48:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:53,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:48:53,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:53,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:48:53,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:48:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:53,996 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:53,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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) [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:53,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:54,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 00:48:54,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:54,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash -464657530, now seen corresponding path program 1 times [2024-11-21 00:48:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953844854] [2024-11-21 00:48:54,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953844854] [2024-11-21 00:48:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953844854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 00:48:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467160968] [2024-11-21 00:48:56,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:48:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:56,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:48:56,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:48:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:56,715 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:56,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:57,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 00:48:57,227 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:48:57,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1519479146, now seen corresponding path program 1 times [2024-11-21 00:48:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:57,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760749224] [2024-11-21 00:48:57,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:48:59,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:59,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760749224] [2024-11-21 00:48:59,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760749224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:48:59,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:48:59,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 00:48:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657274720] [2024-11-21 00:48:59,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:48:59,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:48:59,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:59,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:48:59,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:48:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:59,200 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:59,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2024-11-21 00:48:59,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:59,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:59,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:59,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:59,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:49:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:00,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 00:49:00,090 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:49:00,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash 896077676, now seen corresponding path program 1 times [2024-11-21 00:49:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:00,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573238813] [2024-11-21 00:49:00,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:00,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:05,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573238813] [2024-11-21 00:49:05,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573238813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:49:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608182819] [2024-11-21 00:49:05,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:49:05,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:05,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:49:05,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 00:49:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:05,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1979 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-21 00:49:05,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:49:05,739 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 19 treesize of output 1 [2024-11-21 00:49:05,819 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 31 treesize of output 15 [2024-11-21 00:49:05,915 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 34 treesize of output 28 [2024-11-21 00:49:05,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:49:05,926 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 38 treesize of output 22 [2024-11-21 00:49:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:05,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:49:06,391 INFO L349 Elim1Store]: treesize reduction 51, result has 52.3 percent of original size [2024-11-21 00:49:06,391 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 195 [2024-11-21 00:49:06,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:49:06,414 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 154 treesize of output 148 [2024-11-21 00:49:06,510 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 9 treesize of output 5 [2024-11-21 00:49:06,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:49:06,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 193 [2024-11-21 00:49:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608182819] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-21 00:49:07,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-21 00:49:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16, 6] total 28 [2024-11-21 00:49:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151226828] [2024-11-21 00:49:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:49:07,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 00:49:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:49:07,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 00:49:07,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2024-11-21 00:49:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:07,733 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:49:07,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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) [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:07,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:07,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:49:07,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:07,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:07,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:07,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:09,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 00:49:09,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-21 00:49:09,514 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:49:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2008606565, now seen corresponding path program 1 times [2024-11-21 00:49:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155067275] [2024-11-21 00:49:09,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:09,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155067275] [2024-11-21 00:49:14,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155067275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:49:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697158139] [2024-11-21 00:49:14,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:14,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:49:14,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:14,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:49:14,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 00:49:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:14,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-21 00:49:14,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:49:15,008 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-21 00:49:15,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 11 [2024-11-21 00:49:15,150 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 [2024-11-21 00:49:15,249 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 [2024-11-21 00:49:15,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:15,308 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 [2024-11-21 00:49:15,414 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:49:15,414 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-21 00:49:15,474 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 [2024-11-21 00:49:15,628 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 43 treesize of output 23 [2024-11-21 00:49:15,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:15,699 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 [2024-11-21 00:49:15,884 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 43 treesize of output 23 [2024-11-21 00:49:15,960 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 [2024-11-21 00:49:16,068 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 31 treesize of output 23 [2024-11-21 00:49:16,071 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 33 treesize of output 23 [2024-11-21 00:49:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:16,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:49:19,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_532 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (v_ArrVal_531 (Array Int Int))) (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_531) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647)))) is different from false [2024-11-21 00:49:19,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|))))) is different from false [2024-11-21 00:49:19,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (v_ArrVal_528 Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_528) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< 2147483647 v_ArrVal_528))))) is different from false [2024-11-21 00:49:19,868 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (v_ArrVal_526 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_14| Int) (v_ArrVal_528 Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_526) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_14|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_528) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< 2147483647 v_ArrVal_528)))))) is different from false [2024-11-21 00:49:19,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (v_ArrVal_526 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_14| Int) (v_ArrVal_528 Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (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) v_ArrVal_524)))) (let ((.cse3 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_526) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_14|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_528) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_524) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< 2147483647 v_ArrVal_528)))))) is different from false [2024-11-21 00:49:20,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (v_ArrVal_526 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_14| Int) (v_ArrVal_528 Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_524)))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_526) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_14|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_528) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_524) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< 2147483647 v_ArrVal_528))))))) is different from false [2024-11-21 00:49:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-21 00:49:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697158139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:49:25,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:49:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 43 [2024-11-21 00:49:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027956287] [2024-11-21 00:49:25,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:49:25,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-21 00:49:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:49:25,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-21 00:49:25,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1259, Unknown=21, NotChecked=474, Total=1980 [2024-11-21 00:49:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:25,349 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:49:25,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.7045454545454546) internal successors, (163), 44 states have internal predecessors, (163), 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) [2024-11-21 00:49:25,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:25,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:25,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:25,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:25,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:25,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:25,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:49:29,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 00:49:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-21 00:49:29,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:49:29,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1830669482, now seen corresponding path program 1 times [2024-11-21 00:49:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825704957] [2024-11-21 00:49:29,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825704957] [2024-11-21 00:49:31,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825704957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:49:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129001531] [2024-11-21 00:49:31,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:31,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:49:31,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:31,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:49:31,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 00:49:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:31,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1992 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-21 00:49:31,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:49:31,844 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-21 00:49:31,956 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 [2024-11-21 00:49:32,067 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 [2024-11-21 00:49:32,207 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 [2024-11-21 00:49:32,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:32,260 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 [2024-11-21 00:49:32,404 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 [2024-11-21 00:49:32,503 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 [2024-11-21 00:49:32,612 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 [2024-11-21 00:49:32,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:32,700 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 [2024-11-21 00:49:32,896 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 [2024-11-21 00:49:32,940 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 [2024-11-21 00:49:33,042 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 [2024-11-21 00:49:33,084 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 [2024-11-21 00:49:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:33,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:49:34,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_636) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|)) .cse1))))) is different from false [2024-11-21 00:49:34,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int)) (< 0 (+ 2147483650 (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_636) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|)) .cse1))))) is different from false [2024-11-21 00:49:34,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_634 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_634) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_636) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|)) .cse1))))) is different from false [2024-11-21 00:49:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-21 00:49:35,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129001531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:49:35,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:49:35,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 34 [2024-11-21 00:49:35,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721904160] [2024-11-21 00:49:35,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:49:35,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-21 00:49:35,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:49:35,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-21 00:49:35,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=870, Unknown=8, NotChecked=192, Total=1260 [2024-11-21 00:49:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:35,086 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:49:35,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.857142857142857) internal successors, (170), 35 states have internal predecessors, (170), 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) [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:49:35,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-21 00:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-21 00:49:39,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 00:49:39,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-21 00:49:39,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:49:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash 916181490, now seen corresponding path program 1 times [2024-11-21 00:49:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:39,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687262641] [2024-11-21 00:49:39,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:42,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687262641] [2024-11-21 00:49:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687262641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:49:42,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908311985] [2024-11-21 00:49:42,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:42,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:49:42,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:42,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:49:42,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 00:49:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:43,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1993 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-21 00:49:43,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:49:43,184 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-21 00:49:43,275 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 [2024-11-21 00:49:43,342 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 [2024-11-21 00:49:43,473 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 [2024-11-21 00:49:43,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:43,526 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 [2024-11-21 00:49:43,649 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 [2024-11-21 00:49:43,750 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 [2024-11-21 00:49:43,914 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 [2024-11-21 00:49:43,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:43,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 [2024-11-21 00:49:44,160 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 [2024-11-21 00:49:44,225 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 [2024-11-21 00:49:44,301 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 [2024-11-21 00:49:44,353 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 [2024-11-21 00:49:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:49:44,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:49:44,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1)) 2147483647)) is different from false [2024-11-21 00:49:44,987 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (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_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1)) 2147483647)) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-21 00:49:45,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_741) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse2)) 2147483647))))) is different from false [2024-11-21 00:49:45,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.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 ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_741) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647) (= 400 .cse4)))))) is different from false [2024-11-21 00:49:45,544 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_741) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647) (= 400 .cse4))))))) is different from false [2024-11-21 00:49:45,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (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 (+ .cse0 1))))) (let ((.cse4 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse5 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_741) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse2) 2147483647) (= 400 .cse5))))))))) is different from false [2024-11-21 00:49:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-21 00:49:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908311985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:49:45,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:49:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 38 [2024-11-21 00:49:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860943128] [2024-11-21 00:49:45,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:49:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-21 00:49:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:49:45,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-21 00:49:45,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=890, Unknown=16, NotChecked=414, Total=1560 [2024-11-21 00:49:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:45,948 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:49:45,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.410256410256411) internal successors, (172), 39 states have internal predecessors, (172), 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) [2024-11-21 00:49:45,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:45,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:45,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:45,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:45,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:45,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-21 00:49:45,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-21 00:49:45,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:48,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647)) (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse3 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_741) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647) (= .cse5 400))))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_28| Int) (v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse12 (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_28|)))) (let ((.cse7 (select .cse12 .cse1))) (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse8 (select .cse10 .cse1))) (or (= 400 .cse7) (= 400 .cse8) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_741) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647))))))))) is different from false [2024-11-21 00:49:53,355 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] [2024-11-21 00:49:55,730 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] [2024-11-21 00:49:57,981 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] [2024-11-21 00:49:59,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:50:00,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:50:03,171 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] [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:50:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:50:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:50:07,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 00:50:07,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-21 00:50:07,362 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:50:07,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash 70542131, now seen corresponding path program 1 times [2024-11-21 00:50:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:07,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169063091] [2024-11-21 00:50:07,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:07,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169063091] [2024-11-21 00:50:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169063091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:50:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859069937] [2024-11-21 00:50:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:07,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:50:07,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:50:07,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:50:07,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 00:50:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:08,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 2271 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 00:50:08,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:50:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:08,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 00:50:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859069937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:50:08,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 00:50:08,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2024-11-21 00:50:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678828643] [2024-11-21 00:50:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:50:08,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 00:50:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:08,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 00:50:08,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-21 00:50:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:08,553 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:08,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 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) [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:08,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:50:08,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:50:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:50:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:50:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:09,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-21 00:50:09,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-21 00:50:09,512 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:50:09,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash -28136596, now seen corresponding path program 1 times [2024-11-21 00:50:09,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:09,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157327085] [2024-11-21 00:50:09,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:09,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-21 00:50:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157327085] [2024-11-21 00:50:09,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157327085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:50:09,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:50:09,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 00:50:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993431168] [2024-11-21 00:50:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:50:09,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:50:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:09,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:50:09,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:50:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:09,757 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:09,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:09,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:09,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:50:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:50:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:50:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:10,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 00:50:10,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:50:10,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash 859367085, now seen corresponding path program 2 times [2024-11-21 00:50:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5374753] [2024-11-21 00:50:10,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:20,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5374753] [2024-11-21 00:50:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5374753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:50:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690871093] [2024-11-21 00:50:20,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:50:20,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:50:20,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:50:20,956 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:50:20,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-21 00:50:22,295 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:50:22,295 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:50:22,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 2274 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-21 00:50:22,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:50:22,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2024-11-21 00:50:22,463 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 [2024-11-21 00:50:22,541 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 [2024-11-21 00:50:22,675 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 [2024-11-21 00:50:22,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:22,765 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 [2024-11-21 00:50:22,956 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-21 00:50:22,956 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 42 treesize of output 39 [2024-11-21 00:50:23,044 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 [2024-11-21 00:50:23,168 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 43 treesize of output 23 [2024-11-21 00:50:23,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:23,251 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 [2024-11-21 00:50:23,439 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 [2024-11-21 00:50:23,494 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 [2024-11-21 00:50:23,657 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-21 00:50:23,657 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 42 treesize of output 39 [2024-11-21 00:50:23,774 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 [2024-11-21 00:50:23,920 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 43 treesize of output 23 [2024-11-21 00:50:24,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:24,014 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 [2024-11-21 00:50:24,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 [2024-11-21 00:50:24,286 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 [2024-11-21 00:50:24,443 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-21 00:50:24,444 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 42 treesize of output 39 [2024-11-21 00:50:24,534 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 [2024-11-21 00:50:24,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-21 00:50:24,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:24,876 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 [2024-11-21 00:50:25,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-21 00:50:25,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-21 00:50:25,487 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 38 treesize of output 28 [2024-11-21 00:50:25,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-21 00:50:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:25,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:50:26,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) is different from false [2024-11-21 00:50:26,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)))))) is different from false [2024-11-21 00:50:26,392 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647))))) is different from false [2024-11-21 00:50:31,836 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (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 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse3))) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1185)))))) is different from false [2024-11-21 00:50:31,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185))))))) is different from false [2024-11-21 00:50:31,962 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1177) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))))) is different from false [2024-11-21 00:50:52,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))))) (let ((.cse6 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1177) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|)))))))) is different from false [2024-11-21 00:50:52,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1169) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))))) (let ((.cse2 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1177) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse3 .cse4) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse3 .cse4 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse4) 2147483647) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|)))))))) is different from false [2024-11-21 00:50:55,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_36| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1167) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_36|))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1169) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse4 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1177) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|)))))))) is different from false [2024-11-21 00:50:55,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_36| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1166 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (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) v_ArrVal_1166)))) (let ((.cse5 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1167) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_36|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse8 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1169) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse4 (let ((.cse7 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1166) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|)))))))) is different from false [2024-11-21 00:50:55,707 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_36| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1166 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1166)))) (let ((.cse7 (let ((.cse11 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1167) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_36|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1169) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse4 (let ((.cse9 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1166) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|))))))))) is different from false [2024-11-21 00:50:55,797 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_36| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1166 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1166)))) (let ((.cse6 (let ((.cse11 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1167) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_36|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1169) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse0 (let ((.cse9 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1177) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1166) (< 2147483647 v_ArrVal_1185) (< (select .cse4 .cse5) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse4 .cse5 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse5) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|))))))))) is different from false [2024-11-21 00:51:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 81 refuted. 2 times theorem prover too weak. 0 trivial. 25 not checked. [2024-11-21 00:51:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690871093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:51:08,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:51:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 29] total 77 [2024-11-21 00:51:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918636855] [2024-11-21 00:51:08,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:51:08,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-11-21 00:51:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:51:08,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-21 00:51:08,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=3768, Unknown=68, NotChecked=1692, Total=6162 [2024-11-21 00:51:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:08,281 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:51:08,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 4.397435897435898) internal successors, (343), 78 states have internal predecessors, (343), 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) [2024-11-21 00:51:08,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:08,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:08,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:51:08,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:08,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:25,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse4 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse8 (store .cse0 .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (let ((.cse7 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1177) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1185) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|))))))))) is different from false [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 00:51:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-21 00:51:25,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-21 00:51:25,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:51:25,402 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:51:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:51:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash -892850774, now seen corresponding path program 2 times [2024-11-21 00:51:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:51:25,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664646202] [2024-11-21 00:51:25,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:51:25,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:51:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:51:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:51:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:51:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664646202] [2024-11-21 00:51:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664646202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:51:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978833340] [2024-11-21 00:51:31,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:51:31,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:51:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:51:31,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:51:31,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ae3a9d-e120-4234-98c7-603c39bd2a0e/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 00:51:33,200 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:51:33,200 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:51:33,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-21 00:51:33,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:51:33,229 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-21 00:51:33,312 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 [2024-11-21 00:51:33,376 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 [2024-11-21 00:51:33,479 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 [2024-11-21 00:51:33,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:33,530 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 [2024-11-21 00:51:33,663 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:51:33,664 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-21 00:51:33,731 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 [2024-11-21 00:51:33,823 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 [2024-11-21 00:51:33,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:33,882 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 [2024-11-21 00:51:34,029 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 [2024-11-21 00:51:34,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 11 [2024-11-21 00:51:34,174 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:51:34,175 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-21 00:51:34,234 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 [2024-11-21 00:51:34,328 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 [2024-11-21 00:51:34,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:34,384 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 [2024-11-21 00:51:34,513 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 [2024-11-21 00:51:34,565 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 [2024-11-21 00:51:34,653 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:51:34,653 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-21 00:51:34,720 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 [2024-11-21 00:51:34,812 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 [2024-11-21 00:51:34,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:34,874 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 [2024-11-21 00:51:35,105 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 [2024-11-21 00:51:35,150 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 [2024-11-21 00:51:35,238 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:51:35,238 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-21 00:51:35,280 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 [2024-11-21 00:51:35,288 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 [2024-11-21 00:51:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:51:35,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:51:35,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1)) 2147483647)) is different from false [2024-11-21 00:51:35,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3)) 2147483647)))) is different from false [2024-11-21 00:51:35,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3)) 2147483647)))) is different from false [2024-11-21 00:51:37,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647))))) is different from false [2024-11-21 00:51:37,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (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 ((.cse0 (let ((.cse4 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647))))) is different from false [2024-11-21 00:51:37,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))))) is different from false [2024-11-21 00:51:37,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))) is different from false [2024-11-21 00:51:40,232 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))) is different from false [2024-11-21 00:51:40,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse2 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_1387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3) 2147483647))))))) is different from false [2024-11-21 00:51:40,684 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))))) is different from false [2024-11-21 00:51:45,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (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) v_ArrVal_1367)))) (let ((.cse0 (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse4 (let ((.cse7 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1367) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|))))))) is different from false [2024-11-21 00:51:45,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1367)))) (let ((.cse2 (let ((.cse11 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1367) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3) 2147483647) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|)))))))) is different from false [2024-11-21 00:51:45,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1367)))) (let ((.cse8 (let ((.cse11 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1367) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|)))))))) is different from false [2024-11-21 00:51:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 82 refuted. 2 times theorem prover too weak. 0 trivial. 33 not checked. [2024-11-21 00:51:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978833340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:51:51,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:51:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 29] total 66 [2024-11-21 00:51:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663642865] [2024-11-21 00:51:51,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:51:51,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-21 00:51:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:51:51,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-21 00:51:51,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=2322, Unknown=37, NotChecked=1534, Total=4556 [2024-11-21 00:51:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:51,828 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:51:51,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 5.253731343283582) internal successors, (352), 67 states have internal predecessors, (352), 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) [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:51:51,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 00:51:51,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:51,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:51,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-11-21 00:51:51,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:56,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse7 (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse13 (store .cse16 .cse17 |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (let ((.cse10 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse3 v_ArrVal_1370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse11 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse21 (store .cse16 .cse17 |v_t1Thread1of1ForFork0_enqueue_~x#1_48|))) (let ((.cse22 (let ((.cse25 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1367)) |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|)))) (let ((.cse20 (let ((.cse24 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse3 v_ArrVal_1370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse19 (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse3 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse20 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (+ (select .cse21 .cse1) 1) v_ArrVal_1367) (< (select .cse22 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|))))))) (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (select (let ((.cse26 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647))))) is different from false [2024-11-21 00:51:57,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse7 (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))) (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (select (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))) is different from false [2024-11-21 00:51:57,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647) (< 2147483647 v_ArrVal_1185))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse7 (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1177) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< 2147483647 v_ArrVal_1185) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select (store (store (store .cse8 .cse3 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647) (< (select .cse8 .cse3) (+ v_ArrVal_1189 1))))))))) is different from false [2024-11-21 00:52:13,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse13 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse13 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse13 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse16 (store .cse11 .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (let ((.cse15 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse14 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse14 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1185) (< (select .cse16 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|))))))))) is different from false [2024-11-21 00:52:13,436 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse3 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1387) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse9 (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse7 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_1378) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse14 (let ((.cse15 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-21 00:52:15,449 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] [2024-11-21 00:52:17,460 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] [2024-11-21 00:52:19,936 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] [2024-11-21 00:52:22,279 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] [2024-11-21 00:52:24,289 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] [2024-11-21 00:52:26,511 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] [2024-11-21 00:52:28,558 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] [2024-11-21 00:52:30,588 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] [2024-11-21 00:52:32,601 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] [2024-11-21 00:52:34,625 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] [2024-11-21 00:52:36,635 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] [2024-11-21 00:52:39,109 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] [2024-11-21 00:52:41,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:52:43,138 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] [2024-11-21 00:52:45,151 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] [2024-11-21 00:52:46,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:52:48,678 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] [2024-11-21 00:52:50,687 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] [2024-11-21 00:52:52,701 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] [2024-11-21 00:52:54,790 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] [2024-11-21 00:52:56,801 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] [2024-11-21 00:52:58,847 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] [2024-11-21 00:53:00,860 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] [2024-11-21 00:53:02,868 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] [2024-11-21 00:53:05,328 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] [2024-11-21 00:53:07,341 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] [2024-11-21 00:53:09,349 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] [2024-11-21 00:53:11,676 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] [2024-11-21 00:53:13,687 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] [2024-11-21 00:53:13,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse9 .cse11)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< |c_t2Thread1of1ForFork1_dequeue_#t~post45#1| (+ v_ArrVal_1189 1)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1189) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse2) 2147483647))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1177) .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse6 (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse3 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647) (< (select .cse3 .cse2) (+ v_ArrVal_1189 1)) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1185) .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse12 .cse2) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse12 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse12 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647))))))) is different from false [2024-11-21 00:53:15,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:53:16,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse10 .cse12)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1374 Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1374) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse0 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse2 (let ((.cse6 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1387) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647))) (< .cse8 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1378) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse15 (let ((.cse16 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-21 00:53:18,176 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] [2024-11-21 00:53:20,184 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] [2024-11-21 00:53:22,209 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] [2024-11-21 00:53:24,702 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] [2024-11-21 00:53:26,833 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] [2024-11-21 00:53:28,973 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] [2024-11-21 00:53:30,986 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] [2024-11-21 00:53:32,999 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] [2024-11-21 00:53:35,400 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] [2024-11-21 00:53:37,411 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] [2024-11-21 00:53:39,436 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] [2024-11-21 00:53:42,278 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] [2024-11-21 00:53:46,018 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] [2024-11-21 00:53:48,118 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] [2024-11-21 00:53:59,237 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] [2024-11-21 00:54:01,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:54:03,287 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] [2024-11-21 00:54:05,297 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] [2024-11-21 00:54:07,308 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] [2024-11-21 00:54:23,946 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] [2024-11-21 00:54:25,997 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] [2024-11-21 00:54:28,008 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] [2024-11-21 00:54:30,020 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] [2024-11-21 00:54:32,031 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] [2024-11-21 00:54:34,105 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] [2024-11-21 00:54:36,113 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] [2024-11-21 00:54:38,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:54:40,425 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] [2024-11-21 00:54:42,436 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] [2024-11-21 00:54:44,527 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] [2024-11-21 00:54:46,858 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] [2024-11-21 00:54:48,865 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] [2024-11-21 00:54:50,871 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] [2024-11-21 00:54:52,878 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] [2024-11-21 00:54:54,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:54:56,101 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] [2024-11-21 00:54:58,109 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] [2024-11-21 00:54:58,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse12 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse12 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_36| Int)) (let ((.cse15 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse13 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1185) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse14 .cse1) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse14 .cse1 v_ArrVal_1189) .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_36| 1)) (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-21 00:55:00,178 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] [2024-11-21 00:55:02,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:04,526 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] [2024-11-21 00:55:06,541 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] [2024-11-21 00:55:08,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:10,569 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] [2024-11-21 00:55:12,581 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] [2024-11-21 00:55:15,126 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] [2024-11-21 00:55:17,138 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] [2024-11-21 00:55:19,169 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] [2024-11-21 00:55:22,995 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] [2024-11-21 00:55:25,005 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] [2024-11-21 00:55:27,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:29,043 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] [2024-11-21 00:55:31,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:33,105 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] [2024-11-21 00:55:34,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:36,438 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] [2024-11-21 00:55:38,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:41,910 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] [2024-11-21 00:55:43,922 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] [2024-11-21 00:55:45,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:47,614 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] [2024-11-21 00:55:49,621 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] [2024-11-21 00:55:51,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:53,045 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] [2024-11-21 00:55:55,068 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] [2024-11-21 00:55:57,125 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] [2024-11-21 00:56:00,231 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] [2024-11-21 00:56:03,501 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] [2024-11-21 00:56:06,309 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] [2024-11-21 00:56:08,315 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] [2024-11-21 00:56:10,341 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] [2024-11-21 00:56:10,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse13 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse14 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (select (let ((.cse12 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse13 .cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1) 2147483647)) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse18 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse13 .cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse17 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse16 (let ((.cse19 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse17 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse15 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse15 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse16 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< 2147483647 v_ArrVal_1185) (< (select .cse17 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select (store (store (store .cse15 .cse1 v_ArrVal_1189) .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_40| 1)) (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))))))))) is different from false [2024-11-21 00:56:12,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:56:14,230 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] [2024-11-21 00:56:16,242 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] [2024-11-21 00:56:20,279 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] [2024-11-21 00:56:22,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:56:25,065 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] [2024-11-21 00:56:27,525 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] [2024-11-21 00:56:29,540 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] [2024-11-21 00:56:31,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:56:33,199 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] [2024-11-21 00:56:35,779 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] [2024-11-21 00:56:37,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:56:39,824 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] [2024-11-21 00:56:43,010 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] [2024-11-21 00:56:45,023 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] [2024-11-21 00:57:02,444 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] [2024-11-21 00:57:04,688 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] [2024-11-21 00:57:06,808 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] [2024-11-21 00:57:08,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:57:16,132 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse10 .cse12)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (select (store .cse0 .cse1 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647)) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1177) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse3 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse3 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647) (< (select .cse3 .cse2) (+ v_ArrVal_1189 1)) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1185) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse13 .cse2) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse13 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse13 .cse5)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse16 (store .cse0 .cse1 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (let ((.cse15 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse2 v_ArrVal_1177) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse14 .cse2) (+ v_ArrVal_1189 1)) (< (select .cse15 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse14 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647) (< 2147483647 v_ArrVal_1185) (< (select .cse16 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-21 00:57:16,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-21 00:57:16,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1387) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse8 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-21 00:57:16,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse9)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse10 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse10 .cse1) (+ v_ArrVal_1189 1)))))))) is different from false [2024-11-21 00:57:16,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse5 (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647)))))))) is different from false [2024-11-21 00:57:19,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.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|))))) (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse4 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))))) is different from false [2024-11-21 00:57:28,834 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] [2024-11-21 00:57:30,908 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] [2024-11-21 00:58:10,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (* (select .cse0 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse6 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse6 .cse7)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse9 (store .cse0 .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_1185) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse8 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse7) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse8 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse9 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))))) is different from false [2024-11-21 00:58:10,425 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse6 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|))))))) is different from false [2024-11-21 00:58:12,445 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] [2024-11-21 00:58:15,357 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] [2024-11-21 00:58:17,365 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] [2024-11-21 00:58:19,379 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] [2024-11-21 00:58:21,527 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] [2024-11-21 00:58:23,825 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] [2024-11-21 00:58:26,471 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] [2024-11-21 00:58:28,503 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] [2024-11-21 00:58:30,900 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] [2024-11-21 00:58:33,485 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] [2024-11-21 00:58:35,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:58:37,533 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] [2024-11-21 00:58:40,148 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] [2024-11-21 00:58:42,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:58:45,706 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] [2024-11-21 00:58:47,716 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] [2024-11-21 00:58:49,722 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] [2024-11-21 00:58:51,730 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] [2024-11-21 00:58:53,740 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] [2024-11-21 00:58:55,747 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] [2024-11-21 00:58:57,757 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] [2024-11-21 00:58:59,779 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] [2024-11-21 00:59:02,041 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] [2024-11-21 00:59:04,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:59:06,073 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] [2024-11-21 00:59:08,083 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] [2024-11-21 00:59:10,089 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] [2024-11-21 00:59:13,099 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] [2024-11-21 00:59:15,106 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] [2024-11-21 00:59:18,045 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] [2024-11-21 00:59:20,054 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] [2024-11-21 00:59:22,065 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] [2024-11-21 00:59:24,073 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] [2024-11-21 00:59:26,234 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] [2024-11-21 00:59:28,951 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] [2024-11-21 00:59:28,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse6 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647))))))) is different from false [2024-11-21 00:59:29,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (< .cse0 2147483647) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1383 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse6 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1383) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse7 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|)))))))) is different from false [2024-11-21 00:59:31,241 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] [2024-11-21 00:59:33,251 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] [2024-11-21 00:59:36,327 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] [2024-11-21 00:59:38,332 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] [2024-11-21 00:59:41,502 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] [2024-11-21 00:59:43,826 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] [2024-11-21 00:59:45,911 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] [2024-11-21 00:59:49,189 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] [2024-11-21 00:59:51,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:59:52,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:59:55,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:59:57,594 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] [2024-11-21 00:59:59,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:00:01,310 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] [2024-11-21 01:00:03,321 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] [2024-11-21 01:00:06,637 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] [2024-11-21 01:00:08,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:00:11,024 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] [2024-11-21 01:00:13,106 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] [2024-11-21 01:00:15,145 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] [2024-11-21 01:00:56,304 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] [2024-11-21 01:00:58,321 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] [2024-11-21 01:01:00,330 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] [2024-11-21 01:01:02,338 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] [2024-11-21 01:01:04,344 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] [2024-11-21 01:01:26,534 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] [2024-11-21 01:01:28,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:01:30,565 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] [2024-11-21 01:01:32,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:01:34,521 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] [2024-11-21 01:01:36,544 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] [2024-11-21 01:01:38,552 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] [2024-11-21 01:01:40,710 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] [2024-11-21 01:01:42,721 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] [2024-11-21 01:01:44,872 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] [2024-11-21 01:01:46,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:01:48,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:01:50,932 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] [2024-11-21 01:01:52,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:01:54,960 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] [2024-11-21 01:01:56,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:01:58,984 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] [2024-11-21 01:02:00,999 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] [2024-11-21 01:02:03,247 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] [2024-11-21 01:02:05,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:02:07,118 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] [2024-11-21 01:02:09,129 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] [2024-11-21 01:02:11,142 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] [2024-11-21 01:02:13,174 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] [2024-11-21 01:02:15,180 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] [2024-11-21 01:02:17,191 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] [2024-11-21 01:02:19,201 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] [2024-11-21 01:02:21,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] [2024-11-21 01:02:23,926 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] [2024-11-21 01:02:25,934 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] [2024-11-21 01:02:27,942 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] [2024-11-21 01:02:29,958 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] [2024-11-21 01:02:29,973 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2024-11-21 01:02:31,988 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] [2024-11-21 01:02:34,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:02:36,126 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] [2024-11-21 01:02:37,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:02:39,838 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] [2024-11-21 01:02:41,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 01:02:43,285 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]