./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue.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_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/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_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/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_c9465d00-8154-49d7-9538-99d45c8ebaa3/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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-5e523f4 [2024-11-21 00:47:26,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 00:47:26,417 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-21 00:47:26,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 00:47:26,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 00:47:26,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 00:47:26,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 00:47:26,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 00:47:26,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 00:47:26,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 00:47:26,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 00:47:26,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 00:47:26,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 00:47:26,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 00:47:26,469 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-21 00:47:26,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-21 00:47:26,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 00:47:26,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 00:47:26,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 00:47:26,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 00:47:26,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 00:47:26,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 00:47:26,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 00:47:26,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 00:47:26,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:47:26,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 00:47:26,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 00:47:26,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 00:47:26,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 00:47:26,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 00:47:26,473 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 00:47:26,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 00:47:26,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 00:47:26,474 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-21 00:47:26,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 00:47:26,474 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 00:47:26,474 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 00:47:26,474 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_c9465d00-8154-49d7-9538-99d45c8ebaa3/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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2024-11-21 00:47:26,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 00:47:26,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 00:47:26,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 00:47:26,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 00:47:26,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 00:47:26,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/../../sv-benchmarks/c/pthread/queue.i [2024-11-21 00:47:29,772 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/data/2605bb22f/9b085c0a889a41d2acee0db437f3a421/FLAG7069ece50 [2024-11-21 00:47:30,219 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 00:47:30,220 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/sv-benchmarks/c/pthread/queue.i [2024-11-21 00:47:30,249 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/data/2605bb22f/9b085c0a889a41d2acee0db437f3a421/FLAG7069ece50 [2024-11-21 00:47:30,278 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/data/2605bb22f/9b085c0a889a41d2acee0db437f3a421 [2024-11-21 00:47:30,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 00:47:30,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 00:47:30,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 00:47:30,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 00:47:30,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 00:47:30,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:47:30" (1/1) ... [2024-11-21 00:47:30,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8d56ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:30, skipping insertion in model container [2024-11-21 00:47:30,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:47:30" (1/1) ... [2024-11-21 00:47:30,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 00:47:30,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:47:30,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 00:47:31,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:47:31,112 INFO L204 MainTranslator]: Completed translation [2024-11-21 00:47:31,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31 WrapperNode [2024-11-21 00:47:31,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 00:47:31,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 00:47:31,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 00:47:31,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 00:47:31,121 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:47:31" (1/1) ... [2024-11-21 00:47:31,137 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:47:31" (1/1) ... [2024-11-21 00:47:31,173 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 311 [2024-11-21 00:47:31,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 00:47:31,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 00:47:31,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 00:47:31,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 00:47:31,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 00:47:31,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 00:47:31,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 00:47:31,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 00:47:31,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (1/1) ... [2024-11-21 00:47:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:47:31,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:47:31,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/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:47:31,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/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:47:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-21 00:47:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-21 00:47:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 00:47:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 00:47:31,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 00:47:31,285 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:47:31,479 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 00:47:31,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 00:47:32,125 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 00:47:32,126 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 00:47:32,727 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 00:47:32,728 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 00:47:32,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:47:32 BoogieIcfgContainer [2024-11-21 00:47:32,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 00:47:32,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 00:47:32,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 00:47:32,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 00:47:32,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:47:30" (1/3) ... [2024-11-21 00:47:32,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7306da7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:47:32, skipping insertion in model container [2024-11-21 00:47:32,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:31" (2/3) ... [2024-11-21 00:47:32,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7306da7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:47:32, skipping insertion in model container [2024-11-21 00:47:32,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:47:32" (3/3) ... [2024-11-21 00:47:32,741 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2024-11-21 00:47:32,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 00:47:32,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 77 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2024-11-21 00:47:32,761 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 00:47:32,868 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-21 00:47:32,934 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:47:32,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 00:47:32,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:47:32,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 00:47:32,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 00:47:33,074 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:47:33,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-21 00:47:33,097 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;@5c765db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:47:33,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-21 00:47:33,441 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:47:33,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -598056506, now seen corresponding path program 1 times [2024-11-21 00:47:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120283872] [2024-11-21 00:47:33,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:34,440 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:47:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120283872] [2024-11-21 00:47:34,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120283872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:34,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:34,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:47:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086063597] [2024-11-21 00:47:34,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:34,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:47:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:34,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:47:34,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:47:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:34,474 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:34,477 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:47:34,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:34,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 00:47:34,856 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:47:34,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1359881649, now seen corresponding path program 1 times [2024-11-21 00:47:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939929168] [2024-11-21 00:47:34,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:35,488 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:47:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:35,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939929168] [2024-11-21 00:47:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939929168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:35,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:35,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:47:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850778901] [2024-11-21 00:47:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:35,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:47:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:35,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:47:35,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:47:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:35,493 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:47:35,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:35,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:35,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 00:47:35,678 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:47:35,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:35,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1176179374, now seen corresponding path program 1 times [2024-11-21 00:47:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:35,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127584384] [2024-11-21 00:47:35,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:36,108 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:47:36,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:36,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127584384] [2024-11-21 00:47:36,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127584384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:36,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:36,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:47:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075851384] [2024-11-21 00:47:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:36,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 00:47:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:36,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 00:47:36,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 00:47:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:36,111 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:36,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:47:36,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:36,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:36,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:36,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 00:47:36,959 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:47:36,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1176496242, now seen corresponding path program 1 times [2024-11-21 00:47:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:36,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649045697] [2024-11-21 00:47:36,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:37,098 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:47:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649045697] [2024-11-21 00:47:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649045697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:47:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361561929] [2024-11-21 00:47:37,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:37,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:47:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:37,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:47:37,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:47:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:37,104 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:37,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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:47:37,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:37,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 00:47:37,388 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:47:37,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1683289801, now seen corresponding path program 1 times [2024-11-21 00:47:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:37,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180154135] [2024-11-21 00:47:37,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:37,597 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:47:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180154135] [2024-11-21 00:47:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180154135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:37,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 00:47:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26290888] [2024-11-21 00:47:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:47:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:37,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:47:37,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:47:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:37,601 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:37,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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:47:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:37,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 00:47:37,860 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:47:37,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1852646178, now seen corresponding path program 1 times [2024-11-21 00:47:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079372106] [2024-11-21 00:47:37,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:38,134 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:47:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079372106] [2024-11-21 00:47:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079372106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:47:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485705453] [2024-11-21 00:47:38,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:38,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:47:38,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:47:38,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:47:38,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 00:47:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:38,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 00:47:38,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:47:38,414 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:47:38,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 00:47:38,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485705453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:38,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 00:47:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-21 00:47:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42715137] [2024-11-21 00:47:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:38,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 00:47:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:38,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 00:47:38,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:47:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:38,416 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:38,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 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:47:38,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:38,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 00:47:38,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:47:38,759 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:47:38,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1597455784, now seen corresponding path program 1 times [2024-11-21 00:47:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:38,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778990335] [2024-11-21 00:47:38,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:38,888 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:47:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778990335] [2024-11-21 00:47:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778990335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:47:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659677144] [2024-11-21 00:47:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:47:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:38,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:47:38,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:47:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:38,891 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:38,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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:47:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 00:47:39,077 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:47:39,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1527226746, now seen corresponding path program 1 times [2024-11-21 00:47:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:39,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545581827] [2024-11-21 00:47:39,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:39,242 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:47:39,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:39,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545581827] [2024-11-21 00:47:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545581827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:47:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253348185] [2024-11-21 00:47:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:47:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:47:39,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:47:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:39,244 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:39,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:47:39,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:39,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:39,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 00:47:39,940 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:47:39,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -71834463, now seen corresponding path program 1 times [2024-11-21 00:47:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614499415] [2024-11-21 00:47:39,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:40,063 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:47:40,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:40,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614499415] [2024-11-21 00:47:40,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614499415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:40,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:40,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:47:40,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914344173] [2024-11-21 00:47:40,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:40,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:47:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:40,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:47:40,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:47:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:40,068 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:47:40,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:40,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:40,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:40,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 00:47:40,275 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:47:40,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash 997871183, now seen corresponding path program 1 times [2024-11-21 00:47:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:40,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101569552] [2024-11-21 00:47:40,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:42,013 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:47:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101569552] [2024-11-21 00:47:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101569552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:42,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-21 00:47:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874015861] [2024-11-21 00:47:42,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:42,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 00:47:42,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:42,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 00:47:42,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-21 00:47:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:42,017 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:42,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:42,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:42,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:42,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 00:47:42,695 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:47:42,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash 869236481, now seen corresponding path program 1 times [2024-11-21 00:47:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833150052] [2024-11-21 00:47:42,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:44,033 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:47:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833150052] [2024-11-21 00:47:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833150052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:44,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:44,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 00:47:44,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222479680] [2024-11-21 00:47:44,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:44,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:47:44,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:44,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:47:44,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:47:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:44,036 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:44,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:44,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:44,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 00:47:44,540 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:47:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2112631078, now seen corresponding path program 1 times [2024-11-21 00:47:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395355250] [2024-11-21 00:47:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:45,342 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:47:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395355250] [2024-11-21 00:47:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395355250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:45,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:45,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 00:47:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780616699] [2024-11-21 00:47:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:45,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:47:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:45,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:47:45,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:47:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:45,347 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:45,348 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:47:45,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:45,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 00:47:45,760 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:47:45,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1067054869, now seen corresponding path program 1 times [2024-11-21 00:47:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:45,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220358312] [2024-11-21 00:47:45,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:46,709 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:47:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220358312] [2024-11-21 00:47:46,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220358312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:46,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:46,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 00:47:46,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855648351] [2024-11-21 00:47:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:46,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:47:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:46,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:47:46,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:47:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:46,712 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:46,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:46,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:46,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:46,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:46,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:46,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:46,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:47,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 00:47:47,450 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:47:47,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash -459562613, now seen corresponding path program 1 times [2024-11-21 00:47:47,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:47,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419490924] [2024-11-21 00:47:47,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:47,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:48,152 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:47:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419490924] [2024-11-21 00:47:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419490924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:47:48,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:47:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 00:47:48,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297525139] [2024-11-21 00:47:48,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:47:48,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 00:47:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:48,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 00:47:48,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-21 00:47:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:48,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:48,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 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:47:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:48,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:48,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:48,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:48,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:48,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:48,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:48,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:49,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 00:47:49,133 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:47:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:47:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1361538235, now seen corresponding path program 1 times [2024-11-21 00:47:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:47:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985825892] [2024-11-21 00:47:49,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:47:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:51,397 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:47:51,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:47:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985825892] [2024-11-21 00:47:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985825892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:47:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135991516] [2024-11-21 00:47:51,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:47:51,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:47:51,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:47:51,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:47:51,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 00:47:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:47:51,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-21 00:47:51,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:47:51,666 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 29 treesize of output 1 [2024-11-21 00:47:51,766 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:47:51,767 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:47:51,855 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:47:51,970 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:47:52,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:47:52,039 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:47:52,179 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:47:52,180 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:47:52,274 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:47:52,447 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:47:52,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:47:52,528 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:47:52,776 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:47:52,891 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:47:53,045 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:47:53,050 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:47:53,056 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:47:53,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:47:53,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_487 Int) (v_ArrVal_491 Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_486) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_487) (+ |c_~#queue~0.offset| 80) v_ArrVal_489) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_491) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_487 1))))) is different from false [2024-11-21 00:47:53,731 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_487 Int) (v_ArrVal_484 Int) (v_ArrVal_491 Int) (v_ArrVal_486 (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_484)) |c_~#stored_elements~0.base| v_ArrVal_486) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_487 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_487) (+ |c_~#queue~0.offset| 80) v_ArrVal_489) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491) .cse1) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_484)))) is different from false [2024-11-21 00:47:53,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (forall ((v_ArrVal_489 Int) (v_ArrVal_487 Int) (v_ArrVal_484 Int) (v_ArrVal_491 Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_484)) |c_~#stored_elements~0.base| v_ArrVal_486) |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_484) (< (select .cse2 .cse3) (+ v_ArrVal_487 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_487) (+ |c_~#queue~0.offset| 80) v_ArrVal_489) (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491) .cse3) 2147483647))))))) is different from false [2024-11-21 00:47:56,830 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_487 Int) (v_ArrVal_484 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_491 Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_481))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_484)) |c_~#stored_elements~0.base| v_ArrVal_486) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_484) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse2 .cse3) (+ v_ArrVal_487 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_487) (+ |c_~#queue~0.offset| 80) v_ArrVal_489) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_491) .cse3) 2147483647)))))) is different from false [2024-11-21 00:47:56,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_487 Int) (v_ArrVal_484 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_491 Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_481))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_484)) |c_~#stored_elements~0.base| v_ArrVal_486) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_484) (< (select (store (store (store .cse2 .cse3 v_ArrVal_487) (+ |c_~#queue~0.offset| 80) v_ArrVal_489) (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_491) .cse3) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse2 .cse3) (+ v_ArrVal_487 1)) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38|))))))) is different from false [2024-11-21 00:47:56,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (v_ArrVal_489 Int) (v_ArrVal_487 Int) (v_ArrVal_484 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_491 Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_480) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_481))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse2 v_ArrVal_484)) |c_~#stored_elements~0.base| v_ArrVal_486) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_487) (+ |c_~#queue~0.offset| 80) v_ArrVal_489) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_491) .cse1) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_484) (< (select .cse0 .cse1) (+ v_ArrVal_487 1)) (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38|))))))) is different from false [2024-11-21 00:47:57,666 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:47:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135991516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:47:57,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:47:57,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 39 [2024-11-21 00:47:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497305160] [2024-11-21 00:47:57,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:47:57,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-21 00:47:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:47:57,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-21 00:47:57,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=996, Unknown=22, NotChecked=426, Total=1640 [2024-11-21 00:47:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:47:57,670 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:47:57,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 4.1) internal successors, (164), 40 states have internal predecessors, (164), 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:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:47:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:57,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:57,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:57,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:47:57,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:47:57,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:06,736 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:48:08,750 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:48:10,762 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:48:12,768 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:48:14,786 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:48:16,791 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:48:18,798 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:48:20,806 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:48:25,969 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:48:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-21 00:48:26,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 00:48:26,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:48:26,254 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:48:26,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:26,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1526809706, now seen corresponding path program 1 times [2024-11-21 00:48:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:26,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50154838] [2024-11-21 00:48:26,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:26,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:28,407 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:48:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50154838] [2024-11-21 00:48:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50154838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:48:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229002970] [2024-11-21 00:48:28,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:48:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:48:28,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:48:28,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 00:48:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:28,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-21 00:48:28,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:48:28,690 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:48:28,806 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:48:28,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-21 00:48:29,037 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:48:29,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:48:29,103 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:48:29,256 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:48:29,367 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:48:29,481 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:48:29,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:48:29,573 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:48:29,785 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:48:29,833 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:48:29,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-21 00:48:30,008 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:48:30,054 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:48:30,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:48:30,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_599 Int) (v_ArrVal_594 (Array Int Int))) (< 0 (+ (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_594) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_599)) .cse1)) 2147483650))) is different from false [2024-11-21 00:48:30,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_599 Int) (v_ArrVal_594 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_594) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_599)) .cse1))))) is different from false [2024-11-21 00:48:30,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_599 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_594 (Array Int Int))) (< 0 (+ (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_594) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_599)) .cse1)) 2147483650))) is different from false [2024-11-21 00:48:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-21 00:48:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229002970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:48:32,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:48:32,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 37 [2024-11-21 00:48:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258302538] [2024-11-21 00:48:32,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:48:32,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-21 00:48:32,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:32,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-21 00:48:32,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1042, Unknown=11, NotChecked=210, Total=1482 [2024-11-21 00:48:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:32,418 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 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:32,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:32,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:32,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:32,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:32,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:32,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:32,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-21 00:48:32,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-21 00:48:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:48:35,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 00:48:35,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:48:35,796 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:48:35,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:48:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 86461521, now seen corresponding path program 1 times [2024-11-21 00:48:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:48:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638811492] [2024-11-21 00:48:35,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:48:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:37,990 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:48:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:48:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638811492] [2024-11-21 00:48:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638811492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:48:37,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339069874] [2024-11-21 00:48:37,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:48:37,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:48:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:48:37,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:48:37,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 00:48:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:48:38,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-21 00:48:38,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:48:38,291 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 29 treesize of output 1 [2024-11-21 00:48:38,398 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:48:38,399 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:48:38,478 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:48:38,588 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:48:38,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:48:38,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 16 treesize of output 11 [2024-11-21 00:48:38,808 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:48:38,808 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:48:38,867 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:48:38,991 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:48:39,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:48:39,048 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:48:39,194 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:48:39,235 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:48:39,323 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:48:39,323 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:48:39,364 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:48:39,376 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:48:39,381 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:48:39,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:48:39,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_708)) .cse1)) 2147483647)) is different from false [2024-11-21 00:48:39,840 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 Int) (v_ArrVal_701 Int)) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_701) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse1)) 2147483647))) is different from false [2024-11-21 00:48:39,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_701 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_701) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse3)) 2147483647)))) is different from false [2024-11-21 00:48:42,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_701 Int) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_697) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_699)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_708)) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_701))))) is different from false [2024-11-21 00:48:42,538 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_701 Int) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_697) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse1))) v_ArrVal_699)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse1) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_701))))) is different from false [2024-11-21 00:48:42,589 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_701 Int) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))))) (let ((.cse5 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_697) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_699)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse3) 2147483647) (< (+ (select .cse5 .cse3) 1) v_ArrVal_701)))))) is different from false [2024-11-21 00:48:42,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_701 Int) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))))) (let ((.cse5 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_697) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_699)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse3 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse3) 2147483647) (< (+ (select .cse5 .cse3) 1) v_ArrVal_701)))))) is different from false [2024-11-21 00:48:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-21 00:48:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339069874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:48:42,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:48:42,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 36 [2024-11-21 00:48:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493724734] [2024-11-21 00:48:42,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:48:42,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-21 00:48:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:48:42,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-21 00:48:42,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=718, Unknown=14, NotChecked=448, Total=1406 [2024-11-21 00:48:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:42,921 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:48:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.72972972972973) internal successors, (175), 37 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:48:42,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:48:42,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-21 00:48:42,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:48:42,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:48:45,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:48:46,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:48:48,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (< .cse0 2147483647) (forall ((v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_701 Int)) (or (< (+ .cse0 1) v_ArrVal_701) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_701 Int) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse5 (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_697) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_699)))) (or (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (+ (select .cse6 .cse2) 1) v_ArrVal_701) (< (select (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse2 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse2) 2147483647)))))))) is different from false [2024-11-21 00:48:50,836 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:48:50,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse4 .cse5)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_708 Int) (v_ArrVal_706 Int) (v_ArrVal_705 Int)) (< (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|) (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_705) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) v_ArrVal_706)) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_708)) .cse1) 2147483647)) (< .cse2 2147483647) (forall ((v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_701 Int)) (or (< (+ .cse2 1) v_ArrVal_701) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse1) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_701 Int) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse6 (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (.cse9 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_697) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_699)))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_701) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse1) 2147483647)))))))) is different from false [2024-11-21 00:48:56,028 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:48:58,062 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:48:59,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (< .cse0 2147483647) (forall ((v_ArrVal_703 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_701 Int)) (or (< (+ .cse0 1) v_ArrVal_701) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse2)) 2147483647)))))) is different from false [2024-11-21 00:48:59,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 Int) (v_ArrVal_701 Int)) (or (< (+ .cse0 1) v_ArrVal_701) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_708)) .cse2)) 2147483647))) (< .cse0 2147483647)))) is different from false [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:49:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:49:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:49:00,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-21 00:49:00,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-21 00:49:00,923 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:49:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash 740389138, now seen corresponding path program 1 times [2024-11-21 00:49:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:00,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086608214] [2024-11-21 00:49:00,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:00,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:01,182 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:49:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:01,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086608214] [2024-11-21 00:49:01,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086608214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:49:01,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785339497] [2024-11-21 00:49:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:01,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:49:01,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:01,185 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:49:01,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 00:49:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:01,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 00:49:01,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:49:01,696 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:49:01,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 00:49:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785339497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:49:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 00:49:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2024-11-21 00:49:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068053617] [2024-11-21 00:49:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:49:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 00:49:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:49:01,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 00:49:01,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-21 00:49:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:01,699 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:49:01,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:01,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:01,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:49:01,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:01,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:49:01,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:49:01,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:49:01,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:49:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:02,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 00:49:02,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-21 00:49:02,715 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:49:02,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash -737717364, now seen corresponding path program 1 times [2024-11-21 00:49:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:02,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728830409] [2024-11-21 00:49:02,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:02,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:02,835 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:49:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728830409] [2024-11-21 00:49:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728830409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:49:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:49:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 00:49:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209176466] [2024-11-21 00:49:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:49:02,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:49:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:49:02,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:49:02,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:49:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:02,838 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:49:02,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:02,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:02,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:49:02,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:02,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:49:02,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:49:02,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:49:02,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:02,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:49:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:49:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:49:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:49:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:49:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:49:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:49:03,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 00:49:03,170 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:49:03,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash 149786317, now seen corresponding path program 2 times [2024-11-21 00:49:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:03,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854674413] [2024-11-21 00:49:03,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:09,617 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:49:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854674413] [2024-11-21 00:49:09,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854674413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:49:09,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448265904] [2024-11-21 00:49:09,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:49:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:49:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:09,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:49:09,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 00:49:10,219 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:49:10,223 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:49:10,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 138 conjuncts are in the unsatisfiable core [2024-11-21 00:49:10,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:49:10,304 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:10,450 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:10,568 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:10,718 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:10,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:10,801 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:10,965 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:49:10,965 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:11,149 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:11,416 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:49:11,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:11,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:11,770 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:11,844 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:12,008 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:49:12,008 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:12,127 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:12,293 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:49:12,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:12,397 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:12,668 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:12,755 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:12,922 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:49:12,922 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:13,068 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:13,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-21 00:49:13,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:49:13,464 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:13,805 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:13,955 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:14,168 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:14,183 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:14,193 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:49:14,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:49:21,076 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) (+ |c_~#queue~0.offset| 80) v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1160) .cse1) 2147483647)))) is different from false [2024-11-21 00:49:21,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) (+ |c_~#queue~0.offset| 80) v_ArrVal_1158) (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) is different from false [2024-11-21 00:50:25,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |c_~#queue~0.offset| (* (select .cse0 .cse4) 4)))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store (store .cse0 .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140)) (.cse7 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse6 .cse7 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse4 (+ (select (store (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_1142) .cse7 v_ArrVal_1149) .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140) .cse4) 1) v_ArrVal_1142) (< (select .cse5 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse5 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)) v_ArrVal_1160) .cse1) 2147483647)))))) is different from false [2024-11-21 00:50:25,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1160 Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1137 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1132)))) (let ((.cse4 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store (store .cse4 .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140)) (.cse8 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse7 .cse8 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse7 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse8 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse4 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1132))))))) is different from false [2024-11-21 00:50:25,606 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1160 Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1137 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1132)))) (let ((.cse4 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse4 .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140)) (.cse10 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse9 .cse10 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse9 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse10 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse4 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1132) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1))))))))) is different from false [2024-11-21 00:50:25,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| Int) (v_ArrVal_1160 Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1137 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_1132)))) (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse6 .cse2 v_ArrVal_1137) .cse7 v_ArrVal_1140)) (.cse10 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse9 .cse10 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse9 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| 1)) .cse3 v_ArrVal_1142) .cse10 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1132) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (+ (select (store (store (store .cse6 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse7 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142)))))))) is different from false [2024-11-21 00:50:45,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_1128 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| Int) (v_ArrVal_1160 Int) (v_ArrVal_1130 Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1137 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse0 (let ((.cse12 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1128) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1130))) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1132)) |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (store .cse6 .cse7 v_ArrVal_1137) .cse8 v_ArrVal_1140)) (.cse11 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse10 .cse11 v_ArrVal_1149) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse1 (+ 1 (select (store (store (store .cse10 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| 1)) .cse1 v_ArrVal_1142) .cse11 v_ArrVal_1149) .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1132) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select .cse4 .cse5) (+ v_ArrVal_1155 1)) (< (+ 1 (select (store (store (store .cse6 .cse5 v_ArrVal_1135) .cse7 v_ArrVal_1137) .cse8 v_ArrVal_1140) .cse1)) v_ArrVal_1142) (< (select (store (store (store .cse4 .cse5 v_ArrVal_1155) .cse7 v_ArrVal_1158) (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse5) 2147483647))))))))) is different from false [2024-11-21 00:50:45,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_1128 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_70| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| Int) (v_ArrVal_1160 Int) (v_ArrVal_1130 Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1137 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse5 (let ((.cse12 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1128) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1130))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_70| 1)) .cse4 v_ArrVal_1132)) |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (store .cse0 .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140)) (.cse11 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse10 .cse11 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse4 (+ (select (store (store (store .cse10 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| 1)) .cse4 v_ArrVal_1142) .cse11 v_ArrVal_1149) .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140) .cse4) 1) v_ArrVal_1142) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1132) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (store (store (store .cse8 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse8 .cse1) (+ v_ArrVal_1155 1)))))))))) is different from false [2024-11-21 00:50:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 80 refuted. 4 times theorem prover too weak. 0 trivial. 24 not checked. [2024-11-21 00:50:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448265904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:50:54,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:50:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 29] total 72 [2024-11-21 00:50:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082955944] [2024-11-21 00:50:54,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:50:54,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-21 00:50:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:54,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-21 00:50:54,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=3608, Unknown=97, NotChecked=1080, Total=5402 [2024-11-21 00:50:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:54,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:54,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 4.712328767123288) internal successors, (344), 73 states have internal predecessors, (344), 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:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:54,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:54,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:50:54,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:50:54,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:50:54,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:50:54,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:54,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:54,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:12,862 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:51:14,877 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:51:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:51:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:51:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 00:51:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-21 00:51:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-21 00:51:16,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-21 00:51:16,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:51:16,337 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:51:16,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:51:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2084209166, now seen corresponding path program 2 times [2024-11-21 00:51:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:51:16,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263265348] [2024-11-21 00:51:16,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:51:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:51:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:51:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-21 00:51:18,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:51:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263265348] [2024-11-21 00:51:18,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263265348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:51:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304201897] [2024-11-21 00:51:18,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:51:18,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:51:18,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:51:18,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:51:18,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-21 00:51:18,795 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:51:18,795 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:51:18,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-21 00:51:18,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:51:18,824 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:18,896 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:18,969 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:19,057 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:51:19,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:19,099 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:19,215 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:19,292 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:19,374 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:51:19,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:19,425 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:19,571 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:19,611 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:19,686 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:19,756 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:19,848 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:51:19,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:19,902 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:20,046 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:20,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:20,232 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:20,349 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:20,485 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:51:20,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:20,573 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:20,729 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:20,760 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:20,822 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:20,866 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:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:51:20,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:51:21,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1368 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1362) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1368)) .cse1))))) is different from false [2024-11-21 00:51:21,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1368 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1362) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1368)) .cse1))))) is different from false [2024-11-21 00:51:21,396 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1368 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1362) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1368)) .cse1))))) is different from false [2024-11-21 00:51:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 97 refuted. 3 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-21 00:51:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304201897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:51:33,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:51:33,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 26] total 52 [2024-11-21 00:51:33,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25020784] [2024-11-21 00:51:33,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:51:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-21 00:51:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:51:33,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-21 00:51:33,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=2137, Unknown=12, NotChecked=300, Total=2862 [2024-11-21 00:51:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:33,218 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:51:33,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 6.037735849056604) internal successors, (320), 53 states have internal predecessors, (320), 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:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:51:33,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:51:33,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 00:51:33,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-21 00:51:33,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:51:33,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:33,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-21 00:51:33,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:39,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse11 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1128 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| Int) (v_ArrVal_1160 Int) (v_ArrVal_1130 Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1137 Int)) (let ((.cse6 (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1128) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1130)))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1132)) |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse4 .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140)) (.cse8 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse7 .cse8 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse7 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| 1)) .cse3 v_ArrVal_1142) .cse8 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse4 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1132))))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (or (< (select (store (store (store .cse10 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) .cse11 v_ArrVal_1160) .cse1) 2147483647) (< (select .cse10 .cse1) (+ v_ArrVal_1155 1)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse12 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse10 .cse11 v_ArrVal_1149))) (store (store .cse14 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse13 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse13 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse13 .cse1) (+ v_ArrVal_1155 1))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| Int) (v_ArrVal_1160 Int) (v_ArrVal_1130 Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1137 Int)) (let ((.cse15 (store .cse10 .cse11 v_ArrVal_1130))) (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1132)) |c_~#stored_elements~0.base| v_ArrVal_1134) |c_~#queue~0.base|))) (let ((.cse18 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse19 (store (store .cse17 .cse2 v_ArrVal_1137) .cse18 v_ArrVal_1140)) (.cse20 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse19 .cse20 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse19 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_67| 1)) .cse3 v_ArrVal_1142) .cse20 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (+ (select .cse15 .cse3) 1) v_ArrVal_1132) (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (select (store (store (store .cse16 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse16 .cse1) (+ v_ArrVal_1155 1)) (< (+ (select (store (store (store .cse17 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse18 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142)))))))))) is different from false [2024-11-21 00:51:40,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) .cse3 v_ArrVal_1160) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse4 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse0 .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140)) (.cse8 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse7 .cse8 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse5 (+ (select (store (store (store .cse7 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_1142) .cse8 v_ArrVal_1149) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140) .cse5) 1) v_ArrVal_1142) (< (select .cse6 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse0 .cse3 v_ArrVal_1149))) (store (store .cse10 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ (select .cse10 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse9 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse9 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (select (store (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 v_ArrVal_1142)))) (store .cse14 |c_~#queue~0.base| (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse5) 4)) v_ArrVal_1149)))) (store (store .cse15 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ (select .cse15 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse11 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse11 .cse1) (+ v_ArrVal_1155 1)) (< (+ (select .cse12 .cse13) 1) v_ArrVal_1142)))))))) is different from false [2024-11-21 00:51:58,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:52:00,044 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 00:52:21,132 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:23,356 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:25,374 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:27,524 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:29,567 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:31,894 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:33,904 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:36,198 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 00:52:38,218 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:39,370 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:52:40,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:52:43,025 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:45,044 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:47,056 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:49,084 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 00:52:51,149 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:53,158 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:55,985 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:57,998 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:00,016 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:53:02,922 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:04,931 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:06,941 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:08,970 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:10,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:53:12,545 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:14,555 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:16,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 00:53:18,576 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:18,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse17 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse18 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ (select .cse8 .cse10) 1)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 v_ArrVal_1142)))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse0 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< .cse4 v_ArrVal_1142)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse11 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse17 .cse18 v_ArrVal_1137)))) (let ((.cse12 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140)))) (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse12 .cse15 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse12 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse15 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select .cse12 .cse3) 1) v_ArrVal_1142) (< (select .cse13 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse13 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (or (< |c_t2Thread1of1ForFork1_dequeue_#t~post45#1| (+ v_ArrVal_1155 1)) (< (select (let ((.cse19 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse17 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1155) .cse18 v_ArrVal_1158)) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse10 v_ArrVal_1142)))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse3) 4)) v_ArrVal_1149)))) (store (store .cse22 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse22 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse20 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse20 .cse1) (+ v_ArrVal_1155 1)) (< .cse4 v_ArrVal_1142))))))) is different from false [2024-11-21 00:53:21,685 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:23,693 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:25,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:53:27,258 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,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:53:30,753 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,769 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:53:34,780 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:36,793 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:38,805 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:40,820 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,845 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:53:44,854 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:45,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:53:47,983 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:51,366 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:53,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:55,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:53:57,921 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:00,066 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:02,079 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:06,234 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:08,245 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:10,295 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:12,304 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:14,318 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:16,329 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:18,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 00:54:20,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:54:37,791 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:40,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ (select .cse8 .cse10) 1)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 v_ArrVal_1142)))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse0 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< .cse4 v_ArrVal_1142)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse11 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (forall ((v_ArrVal_1160 Int)) (< (select (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647)) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-21 00:54:43,012 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:49,050 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:54,133 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:55,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:54:56,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:54:59,375 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:00,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:01,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse8 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1147 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1147)))) (store .cse4 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse9 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store (store .cse10 .cse2 v_ArrVal_1137) .cse11 v_ArrVal_1140)) (.cse14 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse13 .cse14 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse13 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse14 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse10 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse11 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (select .cse12 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse12 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int)) (< (select (let ((.cse15 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1158)) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647)) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse16 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse16 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse16 .cse1) (+ v_ArrVal_1155 1))))))) is different from false [2024-11-21 00:55:04,385 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:17,015 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:17,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int)) (< (select (store .cse4 .cse5 v_ArrVal_1160) .cse1) 2147483647)) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse4 .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140)) (.cse8 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse7 .cse8 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse7 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse8 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse4 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (select .cse6 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse4 .cse5 v_ArrVal_1149))) (store (store .cse10 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse9 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse9 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse11 .cse1) (+ v_ArrVal_1155 1)))))))) is different from false [2024-11-21 00:55:18,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse14 (+ (select .cse12 .cse13) 1)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int)) (< (select (store .cse4 .cse5 v_ArrVal_1160) .cse1) 2147483647)) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse4 .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140)) (.cse8 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse7 .cse8 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse7 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse8 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse4 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse5 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (select .cse6 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse4 .cse5 v_ArrVal_1149))) (store (store .cse10 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse9 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse9 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 .cse14)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse11 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 v_ArrVal_1142)))) (store .cse16 |c_~#queue~0.base| (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse3) 4)) v_ArrVal_1149)))) (store (store .cse17 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse17 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse15 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse15 .cse1) (+ v_ArrVal_1155 1)) (< .cse14 v_ArrVal_1142))))))) is different from false [2024-11-21 00:55:19,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse14 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ (select .cse8 .cse10) 1)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 v_ArrVal_1142)))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse0 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< .cse4 v_ArrVal_1142)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse11 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse12 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int)) (< (select (store .cse13 .cse14 v_ArrVal_1160) .cse1) 2147483647)) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store (store .cse13 .cse2 v_ArrVal_1137) .cse14 v_ArrVal_1140)) (.cse17 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse16 .cse17 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse16 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse17 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse13 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse14 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (select .cse15 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse15 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse19 (store .cse13 .cse14 v_ArrVal_1149))) (store (store .cse19 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse19 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse18 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse18 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse18 .cse1) (+ v_ArrVal_1155 1))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse10 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse20 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse20 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse20 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse10 v_ArrVal_1142)))) (store .cse22 |c_~#queue~0.base| (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse3) 4)) v_ArrVal_1149)))) (store (store .cse23 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse23 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse21 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse21 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse21 .cse1) (+ v_ArrVal_1155 1)) (< .cse4 v_ArrVal_1142))))))) is different from false [2024-11-21 00:55:20,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse11 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse12 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) .cse3 v_ArrVal_1160) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)))) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse7 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1135) .cse12 v_ArrVal_1137)))) (let ((.cse4 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1140)))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse4 .cse8 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse5 (+ (select (store (store (store .cse4 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_1142) .cse8 v_ArrVal_1149) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_1142) (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (select .cse6 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse13 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse13 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse15 (store (store .cse0 .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140)) (.cse16 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse15 .cse16 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse5 (+ (select (store (store (store .cse15 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_1142) .cse16 v_ArrVal_1149) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse3 v_ArrVal_1140) .cse5) 1) v_ArrVal_1142) (< (select .cse14 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse14 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (or (< |c_t2Thread1of1ForFork1_dequeue_#t~post45#1| (+ v_ArrVal_1155 1)) (< (select (let ((.cse17 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1155) .cse12 v_ArrVal_1158)) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (select (store (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse19 .cse20 v_ArrVal_1142)))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse5) 4)) v_ArrVal_1149)))) (store (store .cse22 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ (select .cse22 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse18 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse18 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse18 .cse1) (+ v_ArrVal_1155 1)) (< (+ (select .cse19 .cse20) 1) v_ArrVal_1142))))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1147 Int) (v_ArrVal_1158 Int) (v_ArrVal_1146 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1146) .cse12 v_ArrVal_1147)))) (store .cse25 |c_~#queue~0.base| (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse5) 4)) v_ArrVal_1149)))) (store (store .cse26 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ (select .cse26 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse24 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse24 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse24 .cse5)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647))))))) is different from false [2024-11-21 00:55:22,622 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:42,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:55:44,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:55:46,214 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:48,220 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:50,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:55:52,402 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:18,655 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:20,661 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:22,668 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:24,765 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:26,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:56:28,635 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:30,642 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:32,663 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:34,897 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:56,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ (select .cse8 .cse10) 1)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 v_ArrVal_1142)))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse0 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< .cse4 v_ArrVal_1142)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse11 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (forall ((v_ArrVal_1160 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1135 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1137 Int)) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse15 (store (store .cse12 .cse2 v_ArrVal_1137) .cse13 v_ArrVal_1140)) (.cse16 (+ (* v_ArrVal_1142 4) |c_~#queue~0.offset|))) (store (store (store .cse15 .cse16 v_ArrVal_1149) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64| 1)) .cse3 (+ (select (store (store (store .cse15 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1142) .cse16 v_ArrVal_1149) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_64|) (< (+ (select (store (store (store .cse12 .cse1 v_ArrVal_1135) .cse2 v_ArrVal_1137) .cse13 v_ArrVal_1140) .cse3) 1) v_ArrVal_1142) (< (select .cse14 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse14 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse18 (store .cse12 .cse13 v_ArrVal_1149))) (store (store .cse18 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse18 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse17 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse17 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse17 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse10 v_ArrVal_1142)))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) v_ArrVal_1149)))) (store (store .cse21 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse21 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse19 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse19 .cse1) (+ v_ArrVal_1155 1)) (< .cse4 v_ArrVal_1142))))))) is different from false [2024-11-21 00:57:23,269 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:25,298 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:27,305 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:29,312 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:31,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 00:57:33,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:57:35,144 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:37,152 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:38,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:57:50,201 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:52,207 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:54,214 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:56,220 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:59,203 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:01,268 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:03,274 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:05,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:58:08,280 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:37,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (+ (select .cse8 .cse9) 1)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1142)))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_1149)))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse6 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1142) (< (select (store (store (store .cse1 .cse2 v_ArrVal_1155) .cse3 v_ArrVal_1158) (+ (* (select .cse1 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse2) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse1 .cse2) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 .cse11)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse10 .cse2 v_ArrVal_1155) .cse3 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)) v_ArrVal_1160) .cse2) 2147483647) (< (select .cse10 .cse2) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1142 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1142)))) (store .cse13 |c_~#queue~0.base| (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse4) 4)) v_ArrVal_1149)))) (store (store .cse14 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse14 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse12 .cse2 v_ArrVal_1155) .cse3 v_ArrVal_1158) (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse2) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse12 .cse2) (+ v_ArrVal_1155 1)) (< .cse11 v_ArrVal_1142)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 .cse0)) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse16 .cse2) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse16 .cse2 v_ArrVal_1155) .cse3 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse16 .cse4) 4)) v_ArrVal_1160) .cse2) 2147483647))))))) is different from false [2024-11-21 00:58:47,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse4 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse4 .cse1) (+ v_ArrVal_1155 1))))))) is different from false [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:58:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-21 00:58:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:58:48,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-21 00:58:48,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:58:48,407 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 00:58:48,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:58:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1570203141, now seen corresponding path program 2 times [2024-11-21 00:58:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:58:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141136627] [2024-11-21 00:58:48,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:58:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:58:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:58:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:58:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:58:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141136627] [2024-11-21 00:58:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141136627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:58:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297042371] [2024-11-21 00:58:54,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:58:54,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:58:54,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:58:54,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:58:54,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 00:58:55,235 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:58:55,235 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:58:55,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 201 conjuncts are in the unsatisfiable core [2024-11-21 00:58:55,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:58:55,269 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:58:55,381 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:58:55,469 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:58:55,586 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:58:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:58:55,654 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:58:55,820 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:58:55,924 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:58:56,041 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:58:56,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:58:56,141 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:58:56,350 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:58:56,471 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:58:56,645 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:58:56,758 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:58:56,871 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:58:56,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:58:56,980 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:58:57,241 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:58:57,366 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:58:57,528 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:58:57,643 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:58:57,878 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:58:57,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:58:57,983 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:58:58,173 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:58:58,301 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:58:58,467 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:58:58,564 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:58:58,770 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:58:58,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:58:58,862 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:58:59,112 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:58:59,167 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:58:59,332 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:58:59,392 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:58:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:58:59,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:59:00,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1626 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1626)) .cse1)) 2147483647)) is different from false [2024-11-21 00:59:00,031 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1626 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1)) 2147483647)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2024-11-21 00:59:00,051 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1)) 2147483647)) (= .cse4 20)))) is different from false [2024-11-21 00:59:01,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ .cse8 1))))) (let ((.cse4 (let ((.cse5 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse2) 2147483647)))))) (= .cse8 20)))) is different from false [2024-11-21 00:59:04,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse1))) (let ((.cse2 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= .cse4 20) (= .cse5 20)))))))) is different from false [2024-11-21 00:59:04,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse8 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse8 .cse3))) (let ((.cse5 (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse3) 2147483647)))))))) is different from false [2024-11-21 00:59:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 165 refuted. 12 times theorem prover too weak. 0 trivial. 39 not checked. [2024-11-21 00:59:15,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297042371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:59:15,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:59:15,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32, 37] total 95 [2024-11-21 00:59:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478479556] [2024-11-21 00:59:15,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:59:15,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-11-21 00:59:15,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:59:15,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-21 00:59:15,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1502, Invalid=6636, Unknown=76, NotChecked=1098, Total=9312 [2024-11-21 00:59:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:59:15,723 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:59:15,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 96 states have (on average 4.635416666666667) internal successors, (445), 96 states have internal predecessors, (445), 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:59:15,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:59:15,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:59:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-21 00:59:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:59:28,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse30 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse29 .cse30)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (< .cse0 2147483647) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_107| Int) (v_ArrVal_1586 Int) (v_ArrVal_1597 Int) (v_ArrVal_1626 Int)) (let ((.cse8 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse15 (select .cse13 .cse2))) (let ((.cse14 (+ (* .cse15 4) |c_~#queue~0.offset| 4))) (let ((.cse12 (select (store (store (store .cse13 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse15 1)) .cse14 v_ArrVal_1586) .cse2))) (let ((.cse10 (store .cse13 .cse14 v_ArrVal_1586)) (.cse11 (+ (* 4 .cse12) |c_~#queue~0.offset| 4))) (store (store (store .cse10 .cse11 v_ArrVal_1597) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_107| 1)) .cse2 (+ (select (store (store (store .cse10 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_110| 1)) .cse2 (+ .cse12 1)) .cse11 v_ArrVal_1597) .cse2) 1)))))))) |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse6 (select .cse8 .cse2))) (let ((.cse3 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse5 (select .cse3 .cse2))) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse2) 2147483647) (= 20 .cse6) (= 20 .cse5))))))) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_107| Int) (v_ArrVal_1586 Int) (v_ArrVal_1597 Int) (v_ArrVal_1626 Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse29 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse30 (+ .cse0 1))))) (let ((.cse23 (let ((.cse24 (select (store (store .cse19 |c_~#queue~0.base| (let ((.cse25 (let ((.cse28 (select .cse19 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1586)))) (let ((.cse27 (select .cse25 .cse2))) (let ((.cse26 (+ (* .cse27 4) |c_~#queue~0.offset| 4))) (store (store (store .cse25 .cse26 v_ArrVal_1597) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_107| 1)) .cse2 (+ (select (store (store (store .cse25 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_110| 1)) .cse2 (+ .cse27 1)) .cse26 v_ArrVal_1597) .cse2) 1)))))) |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse17 (select .cse23 .cse2))) (let ((.cse20 (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse23 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse2 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse21 (select .cse20 .cse2))) (or (= 20 .cse17) (< (select (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse2 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse2) 2147483647) (= .cse21 20)))))))) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse36 (let ((.cse37 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse37 (+ (* (select .cse37 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse34 (select .cse36 .cse2))) (let ((.cse32 (let ((.cse35 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse36 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse34 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse35 (+ (* 4 (select .cse35 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse33 (select .cse32 .cse2))) (or (< (select (let ((.cse31 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse32 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse2 (+ .cse33 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse2) 2147483647) (= .cse33 20) (= .cse34 20)))))))))) is different from false [2024-11-21 00:59:34,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse2 .cse4))) (let ((.cse6 (= .cse7 20)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ .cse7 1))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1) 2147483647)) .cse6) (< .cse7 2147483647) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse14 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1597)))) (store (store .cse16 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse16 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse8 (select .cse14 .cse1))) (let ((.cse10 (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) v_ArrVal_1617)))) (let ((.cse12 (select .cse10 .cse1))) (or (= 20 .cse8) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= .cse12 20))))))) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse21 (let ((.cse22 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse18 (select .cse21 .cse1))) (or (= .cse18 20) (< (select (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))) .cse6) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse26 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse29 (let ((.cse30 (select (store .cse26 |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse23 (select .cse29 .cse1))) (let ((.cse27 (let ((.cse28 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse29 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse1 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse24 (select .cse27 .cse1))) (or (= .cse23 20) (= .cse24 20) (< (select (let ((.cse25 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse24 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))))))))) is different from false [2024-11-21 00:59:37,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse2 .cse4))) (let ((.cse22 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse19 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse20 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80)) (.cse6 (= .cse7 20)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ .cse7 1))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1) 2147483647)) .cse6) (< .cse7 2147483647) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse11 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse19 .cse20 (+ |c_t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse15 (let ((.cse16 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse17 (let ((.cse18 (select .cse11 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_1597)))) (store (store .cse17 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse17 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse8 (select .cse15 .cse1))) (let ((.cse12 (let ((.cse14 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse15 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse9 (select .cse12 .cse1))) (or (= 20 .cse8) (= .cse9 20) (< (select (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) v_ArrVal_1626)) .cse1) 2147483647)))))))) (forall ((v_ArrVal_1623 Int) (v_ArrVal_1626 Int) (v_ArrVal_1625 Int)) (< (select (let ((.cse21 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse19 .cse22 v_ArrVal_1623) .cse20 v_ArrVal_1625)) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse28 (let ((.cse29 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse30 (let ((.cse31 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1597)))) (store (store .cse30 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse30 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse23 (select .cse28 .cse1))) (let ((.cse25 (let ((.cse27 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse28 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse1 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)) v_ArrVal_1617)))) (let ((.cse26 (select .cse25 .cse1))) (or (= 20 .cse23) (< (select (let ((.cse24 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse25 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= .cse26 20))))))) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1592 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse35 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse19 .cse22 v_ArrVal_1592) .cse20 (+ (select .cse19 .cse20) 1))))) (let ((.cse38 (let ((.cse39 (select (store (store .cse35 |c_~#queue~0.base| (let ((.cse40 (let ((.cse41 (select .cse35 |c_~#queue~0.base|))) (store .cse41 (+ (* (select .cse41 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1597)))) (store (store .cse40 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ 1 (select .cse40 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse39 (+ (* (select .cse39 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse33 (select .cse38 .cse1))) (let ((.cse36 (let ((.cse37 (select (store (store .cse35 |c_~#queue~0.base| (store (store .cse38 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse1 (+ .cse33 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse37 (+ (* (select .cse37 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse32 (select .cse36 .cse1))) (or (= 20 .cse32) (= .cse33 20) (< (select (let ((.cse34 (select (store (store .cse35 |c_~#queue~0.base| (store (store .cse36 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))))) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse44 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse45 (let ((.cse46 (select (store .cse44 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse46 (+ (* (select .cse46 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse42 (select .cse45 .cse1))) (or (= .cse42 20) (< (select (let ((.cse43 (select (store (store .cse44 |c_~#queue~0.base| (store (store .cse45 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse42 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse43 (+ (* (select .cse43 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))) .cse6) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse50 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse53 (let ((.cse54 (select (store .cse50 |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse54 (+ (* (select .cse54 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse47 (select .cse53 .cse1))) (let ((.cse51 (let ((.cse52 (select (store (store .cse50 |c_~#queue~0.base| (store (store .cse53 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse1 (+ .cse47 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse52 (+ (* (select .cse52 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse48 (select .cse51 .cse1))) (or (= .cse47 20) (= .cse48 20) (< (select (let ((.cse49 (select (store (store .cse50 |c_~#queue~0.base| (store (store .cse51 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse48 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse49 (+ (* (select .cse49 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))))))))) is different from false [2024-11-21 00:59:47,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:59:49,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse8 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse6 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int)) (< (select (let ((.cse4 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1158)) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647)) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (or (< |c_t2Thread1of1ForFork1_dequeue_#t~post45#1| (+ v_ArrVal_1155 1)) (< (select (let ((.cse7 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse5 .cse8 v_ArrVal_1155) .cse6 v_ArrVal_1158)) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse9 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse9 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1147 Int) (v_ArrVal_1158 Int) (v_ArrVal_1146 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse5 .cse8 v_ArrVal_1146) .cse6 v_ArrVal_1147)))) (store .cse13 |c_~#queue~0.base| (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_1149)))) (store (store .cse14 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse14 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse12 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse12 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) is different from false [2024-11-21 00:59:49,391 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) (+ |c_~#queue~0.offset| 80) v_ArrVal_1158) (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2024-11-21 00:59:50,096 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse8 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1147 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1147)))) (store .cse4 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse9 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int)) (< (select (let ((.cse10 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1158)) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647)) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse11 .cse1) (+ v_ArrVal_1155 1))))))) is different from false [2024-11-21 00:59:51,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:59:53,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:59:55,839 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:04,310 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,845 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:07,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse7 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse8 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1155 Int) (v_ArrVal_1147 Int) (v_ArrVal_1158 Int) (v_ArrVal_1149 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1147)))) (store .cse4 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1149)))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse9 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160) .cse1) 2147483647)))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int)) (< (select (let ((.cse10 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1158)) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1160)) .cse1) 2147483647)))) is different from false [2024-11-21 01:00:15,383 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:16,015 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse2 .cse4))) (let ((.cse6 (= .cse7 20)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ .cse7 1))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1) 2147483647)) .cse6) (< .cse7 2147483647) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse11 (let ((.cse13 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse8 (select .cse11 .cse1))) (or (= .cse8 20) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))) .cse6) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse20 (let ((.cse21 (select (store .cse17 |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse14 (select .cse20 .cse1))) (let ((.cse18 (let ((.cse19 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse20 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_104| 1)) .cse1 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse15 (select .cse18 .cse1))) (or (= .cse14 20) (= .cse15 20) (< (select (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))))))))) is different from false [2024-11-21 01:00:16,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse15 .cse16))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse15 .cse16 (+ .cse7 1))))) (and (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse4 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1626)) .cse2) 2147483647))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) (< .cse7 2147483647) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse13 (let ((.cse14 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse11 (select .cse13 .cse2))) (let ((.cse9 (let ((.cse12 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse13 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse2) 4)) v_ArrVal_1617)))) (let ((.cse10 (select .cse9 .cse2))) (or (< (select (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse9 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse2) 2147483647) (= .cse11 20) (= .cse10 20))))))))))) is different from false [2024-11-21 01:00:16,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1155 1))))) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int) (v_ArrVal_1154 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1154) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) (+ v_ArrVal_1155 1)) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1155) .cse2 v_ArrVal_1158) (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_1160) .cse1) 2147483647)))))) is different from false [2024-11-21 01:00:19,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (select .cse19 .cse20)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse19 .cse20 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse8 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_1607)))) (let ((.cse6 (select .cse8 .cse1))) (let ((.cse3 (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= .cse6 20) (= .cse5 20))))))) (< .cse10 2147483647) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse19 .cse20 (+ .cse10 1))))) (let ((.cse17 (let ((.cse18 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse15 (select .cse17 .cse1))) (let ((.cse13 (let ((.cse16 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse17 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)) v_ArrVal_1617)))) (let ((.cse14 (select .cse13 .cse1))) (or (< (select (let ((.cse11 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= .cse15 20) (= .cse14 20)))))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 5) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse23 (let ((.cse24 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse21 (select .cse23 .cse1))) (or (= .cse21 20) (< (select (let ((.cse22 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse23 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))))) is different from false [2024-11-21 01:00:20,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse2 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= 20 .cse4))))) (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1626 Int)) (< (select (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse12 (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1601) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse10 (select .cse12 .cse1))) (let ((.cse8 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse9 (select .cse8 .cse1))) (or (< (select (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= .cse9 20) (= .cse10 20))))))))) is different from false [2024-11-21 01:00:23,075 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:26,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse2 .cse4))) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ .cse7 1)) (.cse6 (= .cse7 20)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1) 2147483647)) .cse6) (< .cse7 2147483647) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse11 (let ((.cse13 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse8 (select .cse11 .cse1))) (or (= .cse8 20) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))) .cse6) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse19 (let ((.cse20 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse17 (select .cse19 .cse1))) (let ((.cse16 (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse14 (select .cse16 .cse1))) (or (= .cse14 20) (< (select (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) v_ArrVal_1626)) .cse1) 2147483647) (= 20 .cse17))))))))))) is different from false [2024-11-21 01:00:29,364 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse2 .cse4))) (let ((.cse10 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse11 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ .cse7 1)) (.cse6 (= .cse7 20)) (.cse16 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1) 2147483647)) .cse6) (< .cse7 2147483647) (forall ((v_ArrVal_1623 Int) (v_ArrVal_1626 Int) (v_ArrVal_1625 Int)) (< (select (let ((.cse8 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1623) .cse11 v_ArrVal_1625)) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int) (v_ArrVal_1603 Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1603) .cse11 (+ (select .cse9 .cse11) 1))))) (let ((.cse19 (let ((.cse20 (select .cse14 |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse1) 4)) v_ArrVal_1607)))) (let ((.cse12 (select .cse19 .cse1))) (let ((.cse15 (let ((.cse18 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse19 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_1617)))) (let ((.cse17 (select .cse15 .cse1))) (or (= .cse12 20) (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= .cse17 20)))))))) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse24 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse9 .cse11 (+ |c_t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse27 (let ((.cse28 (select .cse24 |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* (select .cse28 .cse1) 4)) v_ArrVal_1607)))) (let ((.cse21 (select .cse27 .cse1))) (let ((.cse25 (let ((.cse26 (select (store (store .cse24 |c_~#queue~0.base| (store (store .cse27 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse22 (select .cse25 .cse1))) (or (= .cse21 20) (= 20 .cse22) (< (select (let ((.cse23 (select (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ 1 .cse22))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))))) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse31 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse32 (let ((.cse33 (select (store .cse31 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse29 (select .cse32 .cse1))) (or (= .cse29 20) (< (select (let ((.cse30 (select (store (store .cse31 |c_~#queue~0.base| (store (store .cse32 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))) .cse6) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1607 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse39 (let ((.cse40 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse40 (+ (* (select .cse40 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1607)))) (let ((.cse37 (select .cse39 .cse1))) (let ((.cse36 (let ((.cse38 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse39 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse37 1))) |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse34 (select .cse36 .cse1))) (or (= .cse34 20) (< (select (let ((.cse35 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse36 .cse16 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse34 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse35 (+ |c_~#queue~0.offset| (* (select .cse35 .cse1) 4)) v_ArrVal_1626)) .cse1) 2147483647) (= 20 .cse37))))))))))) is different from false [2024-11-21 01:00:33,459 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:40,640 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:44,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse2 .cse4))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ .cse7 1)) (.cse6 (= .cse7 20))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1) 2147483647)) .cse6) (< .cse7 2147483647) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| Int) (v_ArrVal_1626 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 .cse5)))) (let ((.cse11 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse8 (select .cse11 .cse1))) (or (= .cse8 20) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_101| 1)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))))) .cse6))))) is different from false [2024-11-21 01:00:45,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse7 .cse8)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse9 1))))) (let ((.cse4 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1626)) .cse2) 2147483647)))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) (< .cse9 2147483647) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1626 Int)) (< (select (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)) v_ArrVal_1626)) .cse2) 2147483647)) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse14 (let ((.cse15 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse12 (select .cse14 .cse2))) (or (= .cse12 20) (< (select (let ((.cse13 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse14 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse2) 2147483647)))))))) is different from false [2024-11-21 01:00:45,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1626)) .cse1) 2147483647)) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse5 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse3 (select .cse5 .cse1))) (or (= .cse3 20) (< (select (let ((.cse4 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647))))))) is different from false [2024-11-21 01:00:46,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1617 Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1611) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647) (= 20 .cse3))))) (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1626 Int)) (< (select (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1626)) .cse1) 2147483647)))) is different from false [2024-11-21 01:00:49,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1) 2147483647)) (= .cse4 20)) (< .cse4 2147483647) (forall ((v_ArrVal_1617 Int) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (let ((.cse7 (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1617)))) (let ((.cse5 (select .cse7 .cse1))) (or (= .cse5 20) (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_1626)) .cse1) 2147483647)))))))) is different from false [2024-11-21 01:00:57,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1626 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1626)) .cse1)) 2147483647)) (= .cse4 20)) (< .cse4 2147483647)))) is different from false [2024-11-21 01:00:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 01:00:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 01:00:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-21 01:00:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-21 01:00:58,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-21 01:00:58,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 01:00:58,414 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-21 01:00:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 01:00:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1065996765, now seen corresponding path program 3 times [2024-11-21 01:00:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 01:00:58,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050888637] [2024-11-21 01:00:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 01:00:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 01:00:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 01:01:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 01:01:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 01:01:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050888637] [2024-11-21 01:01:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050888637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 01:01:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673498960] [2024-11-21 01:01:13,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 01:01:13,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 01:01:13,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 01:01:13,149 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 01:01:13,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9465d00-8154-49d7-9538-99d45c8ebaa3/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-21 01:01:13,860 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-21 01:01:13,860 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 01:01:13,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-21 01:01:13,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 01:01:15,548 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 26 treesize of output 14 [2024-11-21 01:01:15,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 01:01:15,645 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 17 treesize of output 12 [2024-11-21 01:01:15,853 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 24 treesize of output 12 [2024-11-21 01:01:15,907 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 24 treesize of output 12 [2024-11-21 01:01:16,027 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 01:01:16,027 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 36 treesize of output 30 [2024-11-21 01:01:16,138 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 24 treesize of output 12 [2024-11-21 01:01:16,397 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 33 treesize of output 24 [2024-11-21 01:01:16,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 01:01:16,522 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 24 treesize of output 17 [2024-11-21 01:01:16,854 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 44 treesize of output 24 [2024-11-21 01:01:17,045 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 31 treesize of output 22 [2024-11-21 01:01:17,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 32 treesize of output 24 [2024-11-21 01:01:17,292 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 34 treesize of output 24 [2024-11-21 01:01:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 196 proven. 156 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-21 01:01:17,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 01:01:18,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1968 Int) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1971 Int) (v_ArrVal_1967 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1965) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1967 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1967) (+ |c_~#queue~0.offset| 80) v_ArrVal_1968) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1971) .cse1) 2147483647)))) is different from false [2024-11-21 01:01:18,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (forall ((v_ArrVal_1968 Int) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1971 Int) (v_ArrVal_1967 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1965) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1967 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1967) (+ |c_~#queue~0.offset| 80) v_ArrVal_1968) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1971) .cse1) 2147483647)))) (< 2147483646 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) is different from false [2024-11-21 01:01:23,098 INFO L349 Elim1Store]: treesize reduction 331, result has 42.3 percent of original size [2024-11-21 01:01:23,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 784 treesize of output 443 [2024-11-21 01:01:23,268 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-21 01:01:23,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 282 treesize of output 260 [2024-11-21 01:01:23,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 01:01:23,367 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 389 treesize of output 375 [2024-11-21 01:01:23,403 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 207 treesize of output 183 [2024-11-21 01:01:23,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-21 01:01:23,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-21 01:01:23,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 01:01:23,994 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 57 treesize of output 45 [2024-11-21 01:01:24,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 01:01:24,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 01:01:24,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 328 treesize of output 334 [2024-11-21 01:01:30,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 01:01:30,070 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 3023 treesize of output 2827